{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:37:37Z","timestamp":1773232657239,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"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-9017-6","type":"journal-article","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T14:00:12Z","timestamp":1196431212000},"page":"171-178","source":"Crossref","is-referenced-by-count":40,"title":["Complexity of Bezout\u2019s Theorem VI: Geodesics in the Condition (Number) Metric"],"prefix":"10.1007","volume":"9","author":[{"given":"Michael","family":"Shub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,1]]},"reference":[{"key":"9017_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10208-005-0176-2","volume":"7","author":"C. Beltran","year":"2007","unstructured":"C. Beltran and L. M. Pardo, Smale\u2019s 17th problem: A probabilistic positive solution, Found. Comput. Math. 7 (2007), 87\u2013134.","journal-title":"Found. Comput. Math."},{"key":"9017_CR2","unstructured":"C. Beltran and L. M. Pardo, Smale\u2019s 17th problem: Average polynomial time to compute affine and projective solutions. Preprint."},{"key":"9017_CR3","author":"C. Beltran","year":"2008","unstructured":"C. Beltran and M. Shub, Complexity of Bezout\u2019s theorem VII: Distance estimates in the condition metric. Found. Comput. Math. (2008). doi: 10.1007\/s10208-007-9018-5 .","journal-title":"Found. Comput. Math."},{"key":"9017_CR4","volume-title":"Metric Structures for Riemannian and Non-Riemannian Spaces","author":"M. Gromov","year":"1998","unstructured":"M. Gromov, Metric Structures for Riemannian and Non-Riemannian Spaces, Birkh\u00e4user, Basel, 1998."},{"key":"9017_CR5","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. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, Berlin, 1998."},{"key":"9017_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s102080010032","volume":"2","author":"Y. E. Nesterov","year":"2002","unstructured":"Y. E. Nesterov and M. J. Todd, On the Riemannian geometry defined by self-concordant barriers and interior-point methods, Found. Comput. Math. 2 (2002), 333\u2013361.","journal-title":"Found. Comput. Math."},{"key":"9017_CR7","first-page":"459","volume":"6","author":"M. Shub","year":"1993","unstructured":"M. Shub and S. Smale, Complexity of Bezout\u2019s theorem I: Geometrical aspects, J. Am. Math. Soc. 6\u00a0(1993), 459\u2013501.","journal-title":"J. Am. Math. Soc."},{"key":"9017_CR8","series-title":"Progress in Mathematics","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 and S. Smale, Complexity of Bezout\u2019s theorem II: Volumes and probabilities, in Computational Algebraic Geometry (F. Eyssette and A. Galligo, eds.), Progress in Mathematics, Vol.\u00a0109, pp. 267\u2013285, Birkh\u00e4user, Basel, 1993."},{"key":"9017_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1006\/jcom.1993.1002","volume":"9","author":"M. Shub","year":"1993","unstructured":"M. Shub and S. Smale, Complexity of Bezout\u2019s theorem III: Condition number and packing, J. Complex. 9 (1993), 4\u201314.","journal-title":"J. Complex."},{"key":"9017_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0733008","volume":"33","author":"M. Shub","year":"1996","unstructured":"M. Shub and S. Smale, Complexity of Bezout\u2019s theorem IV: Probability of success; extensions, SINUM 33 (1996), 128\u2013148.","journal-title":"SINUM"},{"key":"9017_CR11","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 and S. Smale, Complexity of Bezout\u2019s theorem V: Polynomial time, Theor. Comput. Sci. 133 (1994), 141\u2013164.","journal-title":"Theor. Comput. Sci."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9017-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-007-9017-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9017-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:05:09Z","timestamp":1559127909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-007-9017-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9017"],"URL":"https:\/\/doi.org\/10.1007\/s10208-007-9017-6","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,1]]}}}