{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:09Z","timestamp":1773228429031,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,12]],"date-time":"2007-12-12T00:00:00Z","timestamp":1197417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10208-007-9018-5","type":"journal-article","created":{"date-parts":[[2007,12,11]],"date-time":"2007-12-11T10:29:41Z","timestamp":1197368981000},"page":"179-195","source":"Crossref","is-referenced-by-count":19,"title":["Complexity of Bezout\u2019s Theorem VII: Distance Estimates in the Condition Metric"],"prefix":"10.1007","volume":"9","author":[{"given":"Carlos","family":"Beltr\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Shub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,12]]},"reference":[{"issue":"1\u20134","key":"9018_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02127800","volume":"16","author":"B. Beauzamy","year":"1996","unstructured":"B. Beauzamy, J.-L. Frot, C. Millour, Massively parallel computations on many-variable polynomials. Ann. Math. Artif. Intell. 16(1\u20134), 251\u2013283 (1996). MR MR1389850 (98c:68078)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9018_CR2","doi-asserted-by":"crossref","unstructured":"C. Beltr\u00e1n, L.M. Pardo, On Smale\u2018s 17th problem: a probabilistic positive answer. Found. Comput. Math. Online First DOI: 10.1007\/s10208-005-0211-0","DOI":"10.1007\/s10208-005-0211-0"},{"key":"9018_CR3","first-page":"1","volume-title":"Foundations of Computational Mathematics","author":"C. Beltr\u00e1n","year":"2006","unstructured":"C. Beltr\u00e1n, L.M. Pardo, On the complexity of non-universal polynomial equation solving: old and new results, in Foundations of Computational Mathematics, ed. by L. Pardo, A. Pinkus, E. S\u00fcli, M. Todd, Santander, 2005 (Cambridge University Press, Cambridge, 2006), pp. 1\u201335"},{"key":"9018_CR4","doi-asserted-by":"crossref","unstructured":"C. Beltr\u00e1n, L.M. Pardo, Smale\u2019s 17th problem: average polynomial time to compute affine and projective solutions. Preprint, 2007","DOI":"10.1090\/S0894-0347-08-00630-9"},{"key":"9018_CR5","unstructured":"C. Borges, L.M. Pardo. Personal communication"},{"issue":"2","key":"9018_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/S0036144595288554","volume":"39","author":"V.Y. Pan","year":"1997","unstructured":"V.Y. Pan, Solving a polynomial equation: some history and recent progress. SIAM Rev. 39(2), 187\u2013220 (1997). MR MR1453318 (99b:65066)","journal-title":"SIAM Rev."},{"issue":"1","key":"9018_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/moor.12.1.121","volume":"12","author":"J. Renegar","year":"1987","unstructured":"J. Renegar, On the efficiency of Newton\u2019s method in approximating all zeros of a system of complex polynomials. Math. Oper. Res. 12(1), 121\u2013148 (1987)","journal-title":"Math. Oper. Res."},{"key":"9018_CR8","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/978-1-4612-2740-3_40","volume-title":"From Topology to Computation: Proceedings of the Smalefest","author":"M. Shub","year":"1993","unstructured":"M. Shub, Some remarks on Bezout\u2019s theorem and complexity theory, in From Topology to Computation: Proceedings of the Smalefest, Berkeley, CA, 1990 (Springer, New York, 1993), pp. 443\u2013455"},{"key":"9018_CR9","doi-asserted-by":"crossref","unstructured":"M. Shub, Complexity of B\u00e9zout\u2019s theorem. VI: Geodesics in the condition (number) metric. (2007). DOI: 10.1007\/s10208-007-9017-6","DOI":"10.1007\/s10208-007-9017-6"},{"issue":"2","key":"9018_CR10","first-page":"459","volume":"6","author":"M. Shub","year":"1993","unstructured":"M. Shub, S. Smale, Complexity of B\u00e9zout\u2019s theorem. I. Geometric aspects. J. Am. Math. Soc. 6(2), 459\u2013501 (1993)","journal-title":"J. Am. Math. Soc."},{"key":"9018_CR11","series-title":"Progr. Math.","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-1-4612-2752-6_19","volume-title":"Computational Algebraic Geometry","author":"M. Shub","year":"1993","unstructured":"M. Shub, S. Smale, Complexity of Bezout\u2019s theorem. II. Volumes and probabilities, in Computational Algebraic Geometry, Nice, 1992. Progr. Math., vol.\u00a0109 (Birkh\u00e4user, Boston, MA, 1993), pp. 267\u2013285"},{"issue":"1","key":"9018_CR12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1006\/jcom.1993.1002","volume":"9","author":"M. Shub","year":"1993","unstructured":"M. Shub, S. Smale, Complexity of Bezout\u2019s theorem. III. Condition number and packing. J. Complexity 9(1), 4\u201314 (1993), Festschrift for Joseph F. Traub, Part I","journal-title":"J. Complexity"},{"issue":"1","key":"9018_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(94)90122-8","volume":"133","author":"M. Shub","year":"1994","unstructured":"M. Shub, S. Smale, Complexity of Bezout\u2019s theorem. V. Polynomial time. Theor. Comput. Sci. 133(1), 141\u2013164 (1994), Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9018_CR14","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0733008","volume":"33","author":"M. Shub","year":"1996","unstructured":"M. Shub, S. Smale, Complexity of Bezout\u2019s theorem. IV. Probability of success; extensions. SIAM J. Numer. Anal. 33(1), 128\u2013148 (1996)","journal-title":"SIAM J. Numer. Anal."},{"key":"9018_CR15","first-page":"271","volume-title":"Mathematics: Frontiers and Perspectives","author":"S. Smale","year":"2000","unstructured":"S. Smale, Mathematical problems for the next century, in Mathematics: Frontiers and Perspectives (Am. Math. Soc., Providence, 2000), pp. 271\u2013294"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-007-9018-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9018-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:09Z","timestamp":1559113509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-007-9018-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,12]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9018"],"URL":"https:\/\/doi.org\/10.1007\/s10208-007-9018-5","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,12]]}}}