Recent developments in information-based complexity
- 1 January 1987
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 17 (1), 9-36
- https://doi.org/10.1090/s0273-0979-1987-15511-x
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 48 references indexed in Scilit:
- Optimal algorithms for linear problems with Gaussian measuresRocky Mountain Journal of Mathematics, 1986
- Information-Based ComplexityAnnual Review of Computer Science, 1986
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- Problem Complexity and Method Efficiency in OptimizationJournal of the Operational Research Society, 1984
- Optimal Error Properties of Finite Element Methods for Second Order Elliptic Dirichlet ProblemsMathematics of Computation, 1982
- An algorithm to solve the m × n assignment problem in expected time O(mn log n)Networks, 1980
- Best approximation of analytic functions from information about their values at a finite number of pointsMathematical Notes, 1976
- Computational Complexity and the Existence of Complexity GapsJournal of the ACM, 1972
- Comparison of iterative methods for the calculation of n th rootsCommunications of the ACM, 1961
- Sequential Minimax Search for a MaximumProceedings of the American Mathematical Society, 1953