{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:08:14Z","timestamp":1725653294075},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_1","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["The Legacy of Turing in Numerical Analysis"],"prefix":"10.1007","author":[{"given":"Felipe","family":"Cucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1090\/S0894-0347-08-00630-9","volume":"22","author":"C. Beltr\u00e1n","year":"2009","unstructured":"Beltr\u00e1n, C., Pardo, L.M.: Smale\u2019s 17th problem: average polynomial time to compute affine and projective solutions. J. Amer. Math. Soc.\u00a022(2), 363\u2013385 (2009)","journal-title":"J. Amer. Math. Soc."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10208-010-9078-9","volume":"11","author":"C. Beltr\u00e1n","year":"2011","unstructured":"Beltr\u00e1n, C., Pardo, L.M.: Fast linear homotopy to find approximate zeros of polynomial systems. Found. Comput. Math.\u00a011(1), 95\u2013129 (2011)","journal-title":"Found. Comput. Math."},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc.\u00a021, 1\u201346 (1989)","journal-title":"Bulletin of the Amer. Math. Soc."},{"key":"1_CR5","unstructured":"B\u00fcrgisser, P., Cucker, F.: Condition. Forthcoming book"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10208-007-9006-9","volume":"9","author":"P. B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P., Cucker, F.: Exotic quantifiers, complexity classes, and complete problems. Found. Comput. Math.\u00a09, 135\u2013170 (2009)","journal-title":"Found. Comput. Math."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Cucker, F.: On a problem posed by Steve Smale. In: To Appear at Annals of Mathematics (2011)","DOI":"10.4007\/annals.2011.174.3.8"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: 3rd Annual ACM Symp. on the Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0609045","volume":"9","author":"A. Edelman","year":"1988","unstructured":"Edelman, A.: Eigenvalues and condition numbers of random matrices. SIAM J. of Matrix Anal. and Applic.\u00a09, 543\u2013556 (1988)","journal-title":"SIAM J. of Matrix Anal. and Applic."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian J. of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian J. of Mathematics"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9472-3","volume-title":"A History of Numerical Analysis from the 16th through the 19th Century","author":"H.H. Goldstine","year":"1977","unstructured":"Goldstine, H.H.: A History of Numerical Analysis from the 16th through the 19th Century. Springer, Heidelberg (1977)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/jcom.1999.0502","volume":"15","author":"P. Koiran","year":"1999","unstructured":"Koiran, P.: The real dimension problem is NPIR-complete. J. of Complexity\u00a015, 227\u2013238 (1999)","journal-title":"J. of Complexity"},{"key":"1_CR14","first-page":"265","volume":"3","author":"L. Levin","year":"1973","unstructured":"Levin, L.: Universal sequential search problems. Probl. Pered. Inform., IX\u00a03, 265\u2013266 (1973) (in Russian); (English translation in Problems of Information Trans. 9,3; corrected translation in [18])","journal-title":"Probl. Pered. Inform., IX"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcom.1994.1001","volume":"10","author":"J. Renegar","year":"1994","unstructured":"Renegar, J.: Is it possible to know a problem instance is ill-posed? J. of Complexity\u00a010, 1\u201356 (1994)","journal-title":"J. of Complexity"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Smale, S.: Complexity theory and numerical analysis. In: Iserles, A. (ed.) Acta Numerica, pp. 523\u2013551. Cambridge University Press (1997)","DOI":"10.1017\/S0962492900002774"},{"key":"1_CR17","unstructured":"Smale, S.: Mathematical problems for the next century. In: Arnold, V., Atiyah, M., Lax, P., Mazur, B. (eds.) Mathematics: Frontiers and Perspectives, pp. 271\u2013294. AMS (2000)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"B.A. Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of russian approaches to perebor (brute-force search) algorithms. Annals of the History of Computing\u00a06, 384\u2013400 (1984)","journal-title":"Annals of the History of Computing"},{"key":"1_CR19","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., Ser. 2\u00a042, 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc., Ser. 2"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1093\/qjmam\/1.1.287","volume":"1","author":"A.M. Turing","year":"1948","unstructured":"Turing, A.M.: Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math.\u00a01, 287\u2013308 (1948)","journal-title":"Quart. J. Mech. Appl. Math."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1090\/S0002-9904-1947-08909-6","volume":"53","author":"J. Neumann von","year":"1947","unstructured":"von Neumann, J., Goldstine, H.H.: Numerical inverting matrices of high order. Bulletin of the Amer. Math. Soc.\u00a053, 1021\u20131099 (1947)","journal-title":"Bulletin of the Amer. Math. Soc."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1090\/S0002-9939-1951-0041539-X","volume":"2","author":"J. Neumann von","year":"1951","unstructured":"von Neumann, J., Goldstine, H.H.: Numerical inverting matrices of high order, II. Proceedings of the Amer. Math. Soc.\u00a02, 188\u2013202 (1951)","journal-title":"Proceedings of the Amer. Math. Soc."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/321637.321638","volume":"18","author":"J. Wilkinson","year":"1971","unstructured":"Wilkinson, J.: Some comments from a numerical analyst. Journal ACM\u00a018, 137\u2013147 (1971)","journal-title":"Journal ACM"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:52:43Z","timestamp":1556149963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}