{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:52:40Z","timestamp":1773150760711,"version":"3.50.1"},"reference-count":30,"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)90023-8","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"107-117","source":"Crossref","is-referenced-by-count":15,"title":["Average case optimality"],"prefix":"10.1016","volume":"1","author":[{"given":"G.W","family":"Wasilkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(85)90023-8_BIB1","article-title":"Evaluating rational functions: Infinite precision is finite cost and tractable on average","author":"Blum","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(85)90023-8_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.4064\/sm-60-1-15-32","article-title":"Elliptically contoured measures on infinite-dimensional Banach spaces","volume":"60","author":"Crawford","year":"1977","journal-title":"Studia Math."},{"key":"10.1016\/0885-064X(85)90023-8_BIB3","series-title":"Proceedings, II Valencia International Meeting on Bayesian Statistics","article-title":"Average case \u03f5-complexity: A Bayesian view","author":"Kadane","year":"1985"},{"key":"10.1016\/0885-064X(85)90023-8_BIB4","series-title":"Can Adaption Help on the Average for Stochastic Information?","author":"Kadane","year":"1984"},{"key":"10.1016\/0885-064X(85)90023-8_BIB5","series-title":"Algorithms and Complexity","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0885-064X(85)90023-8_BIB6","series-title":"Proceedings, 6th Colloq. Auto. Lang. and Program","first-page":"338","article-title":"Recent advances in the probabilistic analysis of graph-theoretic algorithms","volume":"Vol. 71","author":"Karp","year":"1979"},{"key":"10.1016\/0885-064X(85)90023-8_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230100205","article-title":"An Algorithm to solve the m \u00d7 n assignment problem in expected time O(mn log n)","volume":"10","author":"Karp","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0885-064X(85)90023-8_BIB8","series-title":"Proceedings, 24th Annual Symp. on Found. of Comp. Sci.","first-page":"56","article-title":"Monte-Carlo algorithms for enumeration and reliability problems","author":"Karp","year":"1983"},{"key":"10.1016\/0885-064X(85)90023-8_BIB9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0885-064X(85)90021-4","article-title":"Monte-Carlo algorithms for the planar multiterminal network reliability problem","volume":"1","author":"Karp","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90023-8_BIB10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1216\/RMJ-1972-2-3-379","article-title":"Gaussian measure in Hilbert space and application in numerical analysis","volume":"2","author":"Larkin","year":"1972","journal-title":"Rocky Mountain J. Math."},{"key":"10.1016\/0885-064X(85)90023-8_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0885-064X(86)90021-X","article-title":"Approximation of linear functionals on a Banach space with a Gaussian measure","author":"Lee","year":"1986","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90023-8_BIB12","series-title":"Algorithms and Complexity","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0885-064X(85)90023-8_BIB13","series-title":"Proceedings, 24th Annual Symp. on Found. of Comp. Sci.","article-title":"Randomized Byzantine generals","author":"Rabin","year":"1983"},{"key":"10.1016\/0885-064X(85)90023-8_BIB14","article-title":"Removing singularities through randomization","author":"Rabin","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(85)90023-8_BIB15","series-title":"On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials","author":"Renegar","year":"1984"},{"key":"10.1016\/0885-064X(85)90023-8_BIB16","doi-asserted-by":"crossref","DOI":"10.24033\/asens.1486","article-title":"Computational complexity: On the geometry of polynomials and a theory of cost, I","author":"Shub","year":"1985","journal-title":"Ann. Sci. \u00c9cole Norm. Sup."},{"key":"10.1016\/0885-064X(85)90023-8_BIB17","article-title":"Computational complexity: On the geometry of polynomials and a theory of cost, II","author":"Shub","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(85)90023-8_BIB18","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)90023-8_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1981-14858-8","article-title":"The fundamental theorem of algebra and complexity theory","volume":"4","author":"Smale","year":"1981","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0885-064X(85)90023-8_BIB20","series-title":"Mathematical Programming, the State of the Art","article-title":"The problem of the average speed of the simplex method","author":"Smale","year":"1982"},{"key":"10.1016\/0885-064X(85)90023-8_BIB21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","article-title":"On the average number of steps in the simplex method of linear programming","volume":"27","author":"Smale","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0885-064X(85)90023-8_BIB22","series-title":"On the Efficiency of Algorithms of Analysis","author":"Smale","year":"1985"},{"key":"10.1016\/0885-064X(85)90023-8_BIB23","first-page":"145","article-title":"Wiener measure and its applications to approximation methods, I","volume":"13","author":"Suldin","year":"1959","journal-title":"Izv. Vyssh. Uchebn. Zaved. Mat."},{"key":"10.1016\/0885-064X(85)90023-8_BIB24","first-page":"165","article-title":"Wiener measure and its applications to approximation methods, II","volume":"18","author":"Suldin","year":"1960","journal-title":"Izv. Vyssh. Uchebn. Zaved. Mat."},{"key":"10.1016\/0885-064X(85)90023-8_BIB25","series-title":"A General Theory of Optimal Algorithms","author":"Traub","year":"1980"},{"key":"10.1016\/0885-064X(85)90023-8_BIB26","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0885-064X(85)90023-8_BIB27","article-title":"Optimal algorithms for linear problems with Gaussian measure","author":"Wasilkowski","year":"1985","journal-title":"Rocky Mountain J. Math."},{"key":"10.1016\/0885-064X(85)90023-8_BIB28","series-title":"Information of varying cardinality","author":"Wasilkowski","year":"1985"},{"key":"10.1016\/0885-064X(85)90023-8_BIB29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01410103","article-title":"Can adaption help on the average?","volume":"44","author":"Wasilkowski","year":"1984","journal-title":"Numer. Math."},{"key":"10.1016\/0885-064X(85)90023-8_BIB30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0885-064X(85)90020-2","article-title":"A survey of information-based complexity","volume":"1","author":"Wo\u017aniakowski","year":"1985","journal-title":"J. Complexity"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X85900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X85900238?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:12Z","timestamp":1549245552000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X85900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0885064X85900238"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(85)90023-8","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}