Skip to main content
SpringerLink
Log in

Information-based complexity: Recent results and open problems

  • Invited Lectures
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 529))

Included in the following conference series:

  • 150 Accesses

Abstract

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.

This research was supported in part by the National Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Bibliography

  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 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Columbia University, 10027, New York, NY, USA

    Joseph F. Traub

Authors
  1. Joseph F. Traub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Traub, J.F. (1991). Information-based complexity: Recent results and open problems. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-54458-5_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54458-6

  • Online ISBN: 978-3-540-38391-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation