{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T13:59:29Z","timestamp":1776693569699,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,3,8]],"date-time":"2016-03-08T00:00:00Z","timestamp":1457395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10208-016-9309-9","type":"journal-article","created":{"date-parts":[[2016,3,8]],"date-time":"2016-03-08T16:57:27Z","timestamp":1457456247000},"page":"1401-1422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Condition Length and Complexity for the Solution of Polynomial Systems"],"prefix":"10.1007","volume":"16","author":[{"given":"Diego","family":"Armentano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Beltr\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"B\u00fcrgisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Cucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Shub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,8]]},"reference":[{"key":"9309_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.jco.2010.01.003","volume":"26","author":"D Armentano","year":"2010","unstructured":"D.\u00a0Armentano. Stochastic perturbation and smooth condition numbers. Journal of Complexity 26 (2010) 161\u2013171.","journal-title":"Journal of Complexity"},{"key":"9309_CR2","unstructured":"D.\u00a0Armentano, C.\u00a0Beltr\u00e1n, P.\u00a0B\u00fcrgisser, F.\u00a0Cucker, M.\u00a0Shub. A stable, polynomial-time algorithm for the eigenpair problem (2015). Preprint, available at arXiv:1410.0116 ."},{"issue":"1","key":"9309_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00211-010-0334-3","volume":"117","author":"C Beltr\u00e1n","year":"2011","unstructured":"C.\u00a0Beltr\u00e1n. A continuation method to solve polynomial systems and its complexity. Numer. Math. 117 (2011), no.\u00a01, 89\u2013113.","journal-title":"Numer. Math."},{"issue":"2","key":"9309_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10208-013-9143-2","volume":"13","author":"C Beltr\u00e1n","year":"2013","unstructured":"C.\u00a0Beltr\u00e1n and A.\u00a0Leykin. Robust certified numerical homotopy tracking. Found. Comput. Math., 13(2):253\u2013295, 2013.","journal-title":"Found. Comput. Math."},{"issue":"2","key":"9309_CR5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1090\/S0894-0347-08-00630-9","volume":"22","author":"C Beltr\u00e1n","year":"2009","unstructured":"C.\u00a0Beltr\u00e1n and L.\u00a0M. Pardo. Smale\u2019s 17th problem: average polynomial time to compute affine and projective solutions. J. Amer. Math. Soc. 22 (2009), no.\u00a02, 363\u2013385.","journal-title":"J. Amer. Math. Soc."},{"issue":"1","key":"9309_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10208-010-9078-9","volume":"11","author":"C Beltr\u00e1n","year":"2011","unstructured":"C.\u00a0Beltr\u00e1n and L.\u00a0M. Pardo. Fast linear homotopy to find approximate zeros of polynomial systems. Found. Comput. Math. 11 (2011), no. 1, 95\u2013129.","journal-title":"Found. Comput. Math."},{"key":"9309_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1090\/conm\/604\/12069","volume":"604","author":"C Beltr\u00e1n","year":"2013","unstructured":"C.\u00a0Beltr\u00e1n, M.\u00a0Shub. The complexity and geometry of numerically solving polynomial systems. Contemporary Mathematics, volume 604, 2013, pp. 71\u2013104.","journal-title":"Contemporary Mathematics"},{"key":"9309_CR8","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/s10208-012-9134-8","volume":"12","author":"C Beltr\u00e1n","year":"2012","unstructured":"C.\u00a0Beltr\u00e1n, M.\u00a0Shub. On the Geometry and Topology of the Solution Variety for Polynomial System Solving. Found. Comput. Math. 12 (2012), 719\u2013763.","journal-title":"Found. Comput. Math."},{"key":"9309_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and real computation","author":"L Blum","year":"1998","unstructured":"L.\u00a0Blum, F.\u00a0Cucker, M.\u00a0Shub, and S.\u00a0Smale. Complexity and real computation, Springer-Verlag, New York, 1998."},{"key":"9309_CR10","unstructured":"P.\u00a0B\u00fcrgisser and F.\u00a0Cucker. On a problem posed by Steve Smale, Ann. of Math. (2) 174 (2011), no. 3, 1785\u20131836."},{"key":"9309_CR11","doi-asserted-by":"crossref","unstructured":"P.\u00a0B\u00fcrgisser, M.\u00a0Clausen and A.\u00a0Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften, Springer-Verlag, Berlin, 1996.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"9309_CR12","doi-asserted-by":"crossref","unstructured":"P.\u00a0B\u00fcrgisser and F.\u00a0Cucker. Condition, volume 349 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, 2013.","DOI":"10.1007\/978-3-642-38896-5"},{"issue":"1","key":"9309_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1090\/S0002-9939-1994-1195477-8","volume":"121","author":"KP Choi","year":"1994","unstructured":"K.P.\u00a0Choi. On the medians of gamma distributions and an equation of Ramanujan, Proc. Amer. Math. Soc. 121 (1994), no.\u00a01, 245\u2013251.","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"9309_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/drs007","volume":"33","author":"J-P Dedieu","year":"2013","unstructured":"J-P. Dedieu, G.\u00a0Malajovich, and M.\u00a0Shub. Adaptative step size selection for homotopy methods to solve polynomial equations. IMA Journal of Numerical Analysis 33 (2013), no. 1, 1\u201329.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"9309_CR15","unstructured":"P. Lairez. A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time. Preprint, available at arXiv:1507.05485 ."},{"issue":"2","key":"9309_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10208-007-9017-6","volume":"9","author":"M Shub","year":"2009","unstructured":"M.\u00a0Shub. Complexity of Bezout\u2019s theorem. VI. Geodesics in the condition (number) metric. Found. Comput. Math. 9 (2009), no.\u00a02, 171\u2013178.","journal-title":"Found. Comput. Math."},{"key":"9309_CR17","doi-asserted-by":"crossref","unstructured":"M.\u00a0Shub. Some remarks on Bezout\u2019s theorem and complexity theory. In From Topology to Computation: Proceedings of the Smalefest (Berkeley, CA, 1990), 443\u2013455, Springer, New York, 1993.","DOI":"10.1007\/978-1-4612-2740-3_40"},{"issue":"2","key":"9309_CR18","first-page":"459","volume":"6","author":"M Shub","year":"1993","unstructured":"M.\u00a0Shub and S.\u00a0Smale. Complexity of B\u00e9zout\u2019s theorem. I. Geometric aspects. J. Amer. Math. Soc. 6 (1993), no. 2, 459-501.","journal-title":"J. Amer. Math. Soc."},{"key":"9309_CR19","doi-asserted-by":"crossref","unstructured":"M.\u00a0Shub and S.\u00a0Smale. Complexity of B\u00e9zout\u2019s theorem. II: volumes and probabilities. Computational Algebraic Geometry. Progress in Mathematics Volume 109, 1993, pp 267\u2013285","DOI":"10.1007\/978-1-4612-2752-6_19"},{"key":"9309_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(94)90122-8","volume":"133","author":"M Shub","year":"1994","unstructured":"M.\u00a0Shub and S.\u00a0Smale. Complexity of B\u00e9zout\u2019s theorem. V: Polynomial time. Theoretical Computing Science, Vol 133, 1994, pag 141\u2013164.","journal-title":"Theoretical Computing Science"},{"key":"9309_CR21","doi-asserted-by":"crossref","unstructured":"S.\u00a0Smale. Mathematical problems for the next century, Mathematics: frontiers and perspectives, Amer. Math. Soc., Providence, RI, 2000, pp.\u00a0271\u2013294.","DOI":"10.1142\/9789812792815_0045"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9309-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-016-9309-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9309-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9309-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T18:14:54Z","timestamp":1655230494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-016-9309-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,8]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["9309"],"URL":"https:\/\/doi.org\/10.1007\/s10208-016-9309-9","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,8]]}}}