{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:07Z","timestamp":1773228427938,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,3]],"date-time":"2009-10-03T00:00:00Z","timestamp":1254528000000},"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":[[2010,2]]},"DOI":"10.1007\/s10208-009-9054-4","type":"journal-article","created":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T22:12:54Z","timestamp":1254435174000},"page":"115-125","source":"Crossref","is-referenced-by-count":7,"title":["A Note on the Finite Variance of the Averaging Function for Polynomial System Solving"],"prefix":"10.1007","volume":"10","author":[{"given":"Carlos","family":"Beltr\u00e1n","sequence":"first","affiliation":[]},{"given":"Michael","family":"Shub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,3]]},"reference":[{"issue":"1","key":"9054_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10208-005-0211-0","volume":"8","author":"C. Beltr\u00e1n","year":"2008","unstructured":"C. Beltr\u00e1n, L.M. Pardo, On Smale\u2019s 17th problem: a probabilistic positive solution, Found. Comput. Math. 8(1), 1\u201343 (2008).","journal-title":"Found. Comput. Math."},{"key":"9054_CR2","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. Beltr\u00e1n, L.M. Pardo, Smale\u2019s 17th problem: average polynomial time to compute affine and projective solutions, J.\u00a0Am. Math. Soc. 22, 363\u2013385 (2009).","journal-title":"J.\u00a0Am. Math. Soc."},{"key":"9054_CR3","unstructured":"C. Beltr\u00e1n, L.M. Pardo, Fast linear homotopy to find approximate zeros of polynomial systems (to appear)."},{"key":"9054_CR4","unstructured":"C. Beltr\u00e1n, L.M. Pardo, Computing several zeros of polynomial systems: a\u00a0complexity analysis and Shannon\u2019s Entropy (to appear)."},{"key":"9054_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, S. Smale, Complexity and Real Computation (Springer, New York, 1998)."},{"key":"9054_CR6","first-page":"271","volume-title":"Proceedings of the Fifth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"D. Coppersmith","year":"1994","unstructured":"D. Coppersmith, C.A. Neff, Roots of a polynomial and its derivatives, in Proceedings of the Fifth Annual ACM\u2013SIAM Symposium on Discrete Algorithms (Arlington, VA, 1994) (ACM, New York, 1994), pp. 271\u2013279."},{"issue":"2","key":"9054_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/S0097539791201587","volume":"23","author":"M.H. Kim","year":"1994","unstructured":"M.H. Kim, S. Sutherland, Polynomial root-finding algorithms and branched covers, SIAM J. Comput. 23(2), 415\u2013436 (1994).","journal-title":"SIAM J. Comput."},{"key":"9054_CR8","unstructured":"M.H. Kim, M. Martens, S. Sutherland, A\u00a0universal bound for the average cost of rootfinding. Preprint."},{"issue":"2","key":"9054_CR9","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).","journal-title":"SIAM Rev."},{"issue":"2","key":"9054_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","volume":"3","author":"J. Renegar","year":"1987","unstructured":"J. Renegar, On the worst-case arithmetic complexity of approximating zeros of polynomials, J.\u00a0Complex. 3(2), 90\u2013113 (1987).","journal-title":"J.\u00a0Complex."},{"key":"9054_CR11","volume-title":"Real and Complex Analysis","author":"W. Rudin","year":"1987","unstructured":"W. Rudin, Real and Complex Analysis, 3rd edn. (McGraw-Hill Book, New York, 1987).","edition":"3"},{"key":"9054_CR12","volume-title":"Integral Geometry and Geometric Probability","author":"L.A. Santal\u00f3","year":"1976","unstructured":"L.A. Santal\u00f3, Integral Geometry and Geometric Probability (Addison-Wesley, Reading, 1976)."},{"key":"9054_CR13","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), ed. by M.W. Hirsch, J.E. Marsden, M. Shub (Springer, New York, 1993), pp. 443\u2013455."},{"issue":"2","key":"9054_CR14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10208-007-9017-6","volume":"9","author":"M. Shub","year":"2009","unstructured":"M. Shub, Complexity of B\u00e9zout\u2019s theorem. VI: Geodesics in the condition (number) metric, Found. Comput. Math. 9(2), 171\u2013178 (2009).","journal-title":"Found. Comput. Math."},{"issue":"2","key":"9054_CR15","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.\u00a0Am. Math. Soc. 6(2), 459\u2013501 (1993).","journal-title":"J.\u00a0Am. Math. Soc."},{"issue":"1","key":"9054_CR16","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."},{"key":"9054_CR17","series-title":"Acta Numer.","first-page":"523","volume-title":"Acta Numerica, 1997","author":"S. Smale","year":"1997","unstructured":"S. Smale, Complexity theory and numerical analysis, in Acta Numerica, 1997. Acta Numer., vol.\u00a06 (Cambridge University Press, Cambridge, 1997), pp. 523\u2013551."},{"key":"9054_CR18","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 (American Mathematical Society, 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-009-9054-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-009-9054-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-009-9054-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:10Z","timestamp":1559113510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-009-9054-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9054"],"URL":"https:\/\/doi.org\/10.1007\/s10208-009-9054-4","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,3]]}}}