{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:39Z","timestamp":1773228459369,"version":"3.50.1"},"reference-count":42,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,7,12]],"date-time":"2001-07-12T00:00:00Z","timestamp":994896000000},"content-version":"vor","delay-in-days":803,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s0304-3975(98)00300-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"451-465","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Why does information-based complexity use the real number model?"],"prefix":"10.1016","volume":"219","author":[{"given":"Henryk","family":"Wo\u017aniakowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00300-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01390179","article-title":"Numerical stability of descent methods for solving linear equations","volume":"43","author":"Bollen","year":"1980","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB3","series-title":"Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity","author":"Borwein","year":"1987"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB4","series-title":"Analytic Computational Complexity","first-page":"151","article-title":"Multiple-precision zero-finding methods and the complexity of elementary function evaluation","author":"Brent","year":"1975"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321941.321944","article-title":"Fast multiple-precision evaluation of elementary functions","volume":"23","author":"Brent","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progression","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/jcom.1996.0021","article-title":"Topological complexity with continuous operations","volume":"12","author":"Hertling","year":"1996","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB8","series-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham","year":"1996"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0716042","article-title":"Multivariate secant method","volume":"16","author":"Jankowska","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/BF01891832","article-title":"Numerical stability of a convex hull algorithm for simple polygons","volume":"10","author":"Jaromczyk","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0925-7721(94)00017-4","article-title":"Computing convex hull in floating point arithmetic","volume":"4","author":"Jaromczyk","year":"1994","journal-title":"Comput. Geom.: Theory Appl."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB12","first-page":"223","article-title":"Basic concepts in numerical error analysis (suggested by linear algebra problems), in Mathematical models and numerical methods","author":"Kie\u0142basi\u0144ski","year":"1978"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB13","series-title":"Complexity Theory of Real Functions","author":"Ko","year":"1991"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB14","series-title":"Analytic Computational Complexity","first-page":"35","article-title":"The complexity of obtaining starting points for solving operator equations by Newton's method","author":"Kung","year":"1976"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/0204009","article-title":"Computational complexity and numerical stability","volume":"4","author":"Miller","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/jcom.1996.0008","article-title":"An efficient algorithm for the complex roots problem","volume":"12","author":"Neff","year":"1996","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jcom.1995.1002","article-title":"The real number model in numerical analysis","volume":"11","author":"Novak","year":"1995","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB18","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.1090\/S0025-5718-1995-1312098-3","article-title":"Average Case Optimality of a Hybrid Secant-Bisection Method","volume":"64","author":"Novak","year":"1995","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB19","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1006\/jcom.1996.0024","article-title":"Topological complexity of zero finding","volume":"12","author":"Novak","year":"1996","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB20","first-page":"40","article-title":"On two problems in abstract algebra connected with Horner's rule","author":"Ostrowski","year":"1954"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB21_1","first-page":"21","article-title":"On some methods of computing polynomial values","volume":"7","author":"Pan","year":"1962","journal-title":"Problemy Kibernetiki"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB21_2","first-page":"20","volume":"7","author":"Pan","year":"1962"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB22","article-title":"How to multiply matrices fast?","volume":"vol. 179","author":"Pan","year":"1984"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB23","series-title":"Noisy information and computational complexity","author":"Plaskota","year":"1996"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB24","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/BF01832985","article-title":"Average errors for zero finding: lower bounds for smooth or monotone functions","volume":"48","author":"Ritter","year":"1994","journal-title":"Aequationes Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB25","first-page":"565","article-title":"Computation of pi using arithmetic-geometric mean","volume":"30","author":"Salamin","year":"1976","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB26","series-title":"Fast algorithms, A multiple Turing machine implementation","author":"Sch\u00f6nhage","year":"1994"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB27","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01459080","article-title":"Bisection is optimal","volume":"40","author":"Sikorski","year":"1982","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB28","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0885-064X(85)90011-1","article-title":"Optimal solution of nonlinear equations","volume":"1","author":"Sikorski","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB29","first-page":"412","article-title":"Asymptotic optimality of the bisection method","volume":"57","author":"Sikorski","year":"1987","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0885-064X(87)90021-5","article-title":"On the topology of algorithms","volume":"3","author":"Smale","year":"1987","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB31","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB32","series-title":"Information-based Complexity","author":"Traub","year":"1988"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcom.1995.1001","article-title":"Explicit cost bounds of algorithms for multivariate tensor product problems","volume":"11","author":"Wasilkowski","year":"1995","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB34","article-title":"A simple introduction to computable analysis","volume":"171","author":"Weihrauch","year":"1995"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB35","doi-asserted-by":"crossref","DOI":"10.1006\/jcom.1997.0465","article-title":"A refined model of computation for continuous problems","author":"Weihrauch","year":"1998","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB36","series-title":"Rounding errors in algebraic processes","author":"Wilkinson","year":"1963"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB37","series-title":"The algebraic eigenvalue problem","author":"Wilkinson","year":"1965"},{"key":"10.1016\/S0304-3975(98)00300-4_BIB38","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01399601","article-title":"Numerical Stability for Solving Nonlinear Equations","volume":"27","author":"Wo\u017aniakowski","year":"1977","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB39","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01394452","article-title":"Numerical stability of the Chebyshev method for the solution of large linear systems","volume":"28","author":"Wo\u017aniakowski","year":"1977","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB40","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01411845","article-title":"Round-off error analysis of iterations for large linear systems","volume":"30","author":"Wo\u017aniakowski","year":"1978","journal-title":"Numer. Math."},{"key":"10.1016\/S0304-3975(98)00300-4_BIB41","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0024-3795(80)90259-1","article-title":"Round-off error analysis of a new class of conjugate gradient algorithms","volume":"29","author":"Wo\u017aniakowski","year":"1980","journal-title":"Linear Algebra Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003004?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003004?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:52Z","timestamp":1759625512000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0304397598003004"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00300-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Why does information-based complexity use the real number model?","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00300-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}