{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:59:11Z","timestamp":1771700351685,"version":"3.50.1"},"reference-count":59,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0885-064x(85)90020-2","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"11-44","source":"Crossref","is-referenced-by-count":31,"title":["A survey of information-based complexity"],"prefix":"10.1016","volume":"1","author":[{"given":"H","family":"Wo\u017aniakowski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(85)90020-2_BIB1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF02170998","article-title":"A general method for the construction of interpolating or smoothing spline functions","volume":"12","author":"Anselone","year":"1968","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB2","first-page":"2149","article-title":"Fonctions-spline g\u00e9n\u00e9ralis\u00e9es","volume":"216","author":"Atteia","year":"1965","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/0885-064X(85)90020-2_BIB3","article-title":"Theoretical Background and Constructing of Computational Algorithms for Mathematical-Physical Problems","author":"Babenko","year":"1979"},{"key":"10.1016\/0885-064X(85)90020-2_BIB4_1","first-page":"1014","article-title":"On the optimality of linear methods for operator approximation in convex classes of functions","volume":"11","author":"Bakhvalov","year":"1971","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"10.1016\/0885-064X(85)90020-2_BIB4_2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0041-5553(71)90017-6","volume":"11","author":"Bakhvalov","year":"1971","journal-title":"Comput. Math. Math. Phys."},{"key":"10.1016\/0885-064X(85)90020-2_BIB5_1","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321679.321691","article-title":"Complexity classes of recursive functions and the existence of complexity gaps","volume":"19","author":"Borodin","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(85)90020-2_BIB5_2","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/321707.321723","article-title":"Complexity classes of recursive functions and the existence of complexity gaps","volume":"19","author":"Borodin","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(85)90020-2_BIB6","series-title":"On the optimality of Krylov information, in progress","author":"Chou","year":"1985"},{"key":"10.1016\/0885-064X(85)90020-2_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/00036818008839292","article-title":"Optimal sequential and non-sequential procedures for evaluating a functional","volume":"10","author":"Gal","year":"1980","journal-title":"Appl. Anal."},{"key":"10.1016\/0885-064X(85)90020-2_BIB8","series-title":"On Numerical Approximation","first-page":"117","article-title":"Optimal approximation and error bounds","author":"Golomb","year":"1959"},{"key":"10.1016\/0885-064X(85)90020-2_BIB9","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/0022-247X(72)90003-0","article-title":"R-Splines in Banach spaces, I. Interpolation of linear manifolds","volume":"40","author":"Homes","year":"1972","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0885-064X(85)90020-2_BIB10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01934413","article-title":"On the optimal error of algorithms for solving a scalar autonomous ODE","volume":"22","author":"Kacewicz","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0885-064X(85)90020-2_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02218442","article-title":"Optimality of Euler-integral information for solving a scalar autonomous ODE","volume":"23","author":"Kacewicz","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0885-064X(85)90020-2_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01379663","article-title":"How to increase the order to get minimal-error algorithms for systems of ODE","volume":"45","author":"Kacewicz","year":"1984","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB13","series-title":"Asymptotic Error of Algorithms for Solving Nonlinear Problems","author":"Kacewicz","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB14","series-title":"Proceedings, II Valencia International Meeting on Bayesian Statistics","article-title":"Average case \u03f5-complexity: A Bayesian view","author":"Kadane","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB15","series-title":"Can Adaption Help on the Average for Stochastic Information?","author":"Kadane","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB16","first-page":"502","article-title":"Sequential minimax search for a maximum","volume":"4","author":"Kiefer","year":"1953"},{"key":"10.1016\/0885-064X(85)90020-2_BIB17","series-title":"Optimal recovery of band and energy limited signals","author":"Kowalski","year":"1985"},{"key":"10.1016\/0885-064X(85)90020-2_BIB18","article-title":"A generalized minimal residual algorithm for finding an eigenpair of a large matrix","author":"Kuczy\u0144ski","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB19","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0885-064X(85)90025-1","article-title":"Optimal algorithms for image understanding: Current status and future plans","volume":"1","author":"Lee","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB20","article-title":"Approximation of linear functionals on a Banach space with a Gaussian measure","author":"Lee","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB21","series-title":"Optimal Estimation in Approximation Theory","first-page":"1","article-title":"A survey of optimal recovery","author":"Micchelli","year":"1977"},{"key":"10.1016\/0885-064X(85)90020-2_BIB22_1","first-page":"1060","article-title":"On the best quadrature formula of the form \u03a3k=1n pkf(xk) for some classes of periodic differentiable functions","volume":"211","author":"Motornyj","year":"1973","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0885-064X(85)90020-2_BIB22_2","first-page":"1180","volume":"14","author":"Motornyj","year":"1973","journal-title":"Soviet. Math. Dokl."},{"key":"10.1016\/0885-064X(85)90020-2_BIB23","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"key":"10.1016\/0885-064X(85)90020-2_BIB24","first-page":"165","article-title":"On the problem of approximation estimate by quadrature formulae","volume":"5","author":"Nikolskid","year":"1950","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/0885-064X(85)90020-2_BIB25_1","first-page":"29","article-title":"Best approximation of analytic functions from information about their values at a finite number of points","volume":"19","author":"Osipenko","year":"1976","journal-title":"Mat. Zametki"},{"key":"10.1016\/0885-064X(85)90020-2_BIB25_2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01147612","volume":"19","author":"Osipenko","year":"1976","journal-title":"Math. Notes"},{"key":"10.1016\/0885-064X(85)90020-2_BIB26","article-title":"Linear problems (with extended range) have linear optimal algorithms","author":"Packel","year":"1984","journal-title":"Aequationes Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB27","series-title":"Intractable problems in control theory","author":"Papadimitriou","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB28","series-title":"n-Widths in Approximation Theory","author":"Pinkus","year":"1985"},{"key":"10.1016\/0885-064X(85)90020-2_BIB29","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","article-title":"Coping with errors in binary search procedures","volume":"20","author":"Rivest","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0885-064X(85)90020-2_BIB30","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/2372095","article-title":"Best approximate integration formulas; best approximation formulas","volume":"71","author":"Sard","year":"1949","journal-title":"Amer. J. Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB31","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\/0885-064X(85)90020-2_BIB32","doi-asserted-by":"crossref","DOI":"10.1016\/0885-064X(85)90011-1","article-title":"Optimal solution of nonlinear equations","author":"Sikorski","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB33","article-title":"On Optimal Restoration of Functions and Functionals of Them","author":"Smolyak","year":"1965"},{"key":"10.1016\/0885-064X(85)90020-2_BIB34","article-title":"Information, complexity, and the sciences","author":"Traub","year":"1985"},{"key":"10.1016\/0885-064X(85)90020-2_BIB35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0885-064X(85)90019-6","article-title":"Complexity of approximately solved problems","volume":"1","author":"Traub","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB36","series-title":"Information, Uncertainty, Complexity","author":"Traub","year":"1983"},{"key":"10.1016\/0885-064X(85)90020-2_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90009-4","article-title":"Average case optimality for linear problems","volume":"29","author":"Traub","year":"1984","journal-title":"J. TCS"},{"key":"10.1016\/0885-064X(85)90020-2_BIB38","series-title":"Proceedings, 23rd IEEE Conference on Decision and Control","first-page":"1536","article-title":"When is nonadaptive information as powerful as adaptive information?","author":"Traub","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB39","series-title":"A General Theory of Optimal Algorithms","author":"Traub","year":"1980"},{"key":"10.1016\/0885-064X(85)90020-2_BIB40","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(82)90047-5","article-title":"Complexity of linear programming","volume":"1","author":"Traub","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0885-064X(85)90020-2_BIB41","first-page":"35","article-title":"Information and computation","volume":"Vol. 23","author":"Traub","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB42","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1145\/828.830","article-title":"On the optimal solution of large linear systems","volume":"31","author":"Traub","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(85)90020-2_BIB43","series-title":"Asymptotic setting for linear problems","author":"Trojan","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB44","article-title":"Introduction to the Mathematics of Inversion in Remote Sensing and Indirect Measurement","volume":"Vol. 3","author":"Twomey","year":"1977"},{"key":"10.1016\/0885-064X(85)90020-2_BIB45","series-title":"Local Average Error","author":"Wasilkowski","year":"1983"},{"key":"10.1016\/0885-064X(85)90020-2_BIB46","article-title":"Optimal algorithms for linear problems with Gaussian measures","author":"Wasilkowski","year":"1984","journal-title":"Rocky Mountain J. Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB47","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0885-064X(85)90023-8","article-title":"Average case optimality","volume":"1","author":"Wasilkowski","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB48","series-title":"Information of varying cardinality, in progress","author":"Wasilkowski","year":"1985"},{"key":"10.1016\/0885-064X(85)90020-2_BIB49","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01410103","article-title":"Can adaption help on the average?","volume":"44","author":"Wasilskowski","year":"1984","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB50","series-title":"On Optimal Algorithms in an Asymptotic Model with Gaussian Measure","author":"Wasilkowski","year":"1984"},{"key":"10.1016\/0885-064X(85)90020-2_BIB51","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF02189667","article-title":"Measuring uncertainty without a norm","volume":"26","author":"Werschulz","year":"1983","journal-title":"Aequationes Math."},{"key":"10.1016\/0885-064X(85)90020-2_BIB52","article-title":"Complexity of indefinite elliptic problems","author":"Werschulz","year":"1983","journal-title":"Math. Comp."},{"key":"10.1016\/0885-064X(85)90020-2_BIB53","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0021-9045(85)90060-7","article-title":"What is the complexity of elliptic systems?","volume":"45","author":"Werschulz","year":"1985","journal-title":"J. Approx. Theory."},{"key":"10.1016\/0885-064X(85)90020-2_BIB54","doi-asserted-by":"crossref","DOI":"10.1016\/0885-064X(85)90013-5","article-title":"Complexity of differential and integral equations","author":"Werschulz","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90020-2_BIB55","series-title":"Are Linear Algorithms Always Good for Linear Problems?","author":"Werschulz","year":"1985"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X85900202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X85900202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:59:11Z","timestamp":1549245551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X85900202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0885064X85900202"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(85)90020-2","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}