Information-based complexity: Recent results and open problems
Information-based complexity (IBC) studies the computational complexity of infinite dimensional problems. These are problems where either the input or output are elements of infinite dimensional spaces. Such problems commonly arise in the continuous mathematical models used in science and engineering. Examples include optimization, integration, approximation, ordinary and partial differential equations, and integral equations.
Unable to display preview. Download preview PDF.
- 1.J. F. Traub, G.W. Wasilkowski, H. Wozniakowski, "Information-based complexity", Academic Press, New York, 1988.Google Scholar
- 2.J. F. Traub, H. Wozniakowski, "Theory and applications of information-based complexity", to appear in Lectures in Complex Systems, Santa Fe Institute Studies in the Sciences of Complexity, Lect, Vol. III (L. Nadel and D. Stern, eds.), Addison-Wesley, Massachusetts, 1991.Google Scholar
- 3.H. Wozniakowski, "Average case complexity of multivariate integration", Bull. Amer. Math. Soc. 24 (1991), 34–43.Google Scholar
- 4.J. F. Traub and H. Wozniakowski, "Information-based complexity: New questions for mathematicians" Math. Intell., 13(1991), 34–43.Google Scholar
- 5.J F. Traub, "What is scientifically knowable?,to appear Proceedings, Twenty Fifth Anniversary Symposium, School of Computer Science, Carnegie-Mellon University, Addison-Wesley, Massachusetts, 1991.Google Scholar
- 6.H. Novak, "Quadrature formulas for monotone functions", to appear Proceedings, Amer. Math. Soc.Google Scholar
- 7.S. Heinrich, Private Communication.Google Scholar
- 8.S. Heinrich and J.D. Kern, "Parallel information-based complexity", 1990, to appear.Google Scholar
- 9.E. Novak and K. Richter, "Average errors for zero finding: lower bounds", Preliminary Tech. Rept. March, 1991.Google Scholar