# Information-based complexity

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Information-based_complexity
> Markdown URL: https://mediated.wiki/source/Information-based_complexity.md
> Source: https://en.wikipedia.org/wiki/Information-based_complexity
> Source revision: 1334524772
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

{{no footnotes|date=October 2014}}
'''Information-based complexity''' ('''IBC''') studies optimal [algorithms](/source/algorithms) and [computational complexity](/source/Analysis_of_algorithms) for the continuous problems that arise in [physical science](/source/physical_science), [economics](/source/economics), [engineering](/source/engineering), and [mathematical finance](/source/mathematical_finance). 

==Further reading==
*Traub, J. F., ''Iterative Methods for the Solution of Equations,'' Prentice Hall, 1964. Reissued Chelsea Publishing Company, 1982; Russian translation MIR, 1985; Reissued American Mathematical Society, 1998
*Traub, J. F., and Woźniakowski, H., ''A General Theory of Optimal Algorithms,'' Academic Press, New York, 1980
*Traub, J. F., Woźniakowski, H., and Wasilkowski, G. W., ''Information, Uncertainty, Complexity,'' Addison-Wesley, New York, 1983
*Novak, E., ''Deterministic and Stochastic Error Bounds in Numerical Analysis,'' Lecture Notes in Mathematics, vol. 1349, Springer-Verlag, New  York, 1988
*{{cite book|author=Traub, J. F., Woźniakowski, H., and Wasilkowski, G. W.|title=Information-Based Complexity|publisher=Academic Press|location=New York|year=1988|isbn=978-0126975451}}
*Werschulz, A. G., ''The Computational Complexity of Differential and Integral Equations: An Information-Based Approach,'' Oxford University Press, New York, 1991
*Kowalski, M., Sikorski, K., and Stenger, F., ''Selected Topics in Approximation and Computation,'' Oxford University Press, Oxford, UK, 1995
*Plaskota, L., ''Noisy Information and Computational Complexity,'' Cambridge University Press, Cambridge, UK, 1996
*Traub, J. F., and Werschulz, A. G., ''Complexity and Information,'' Oxford University Press, Oxford, UK, 1998
*Ritter, K., ''Average-Case Analysis of Numerical Problems,'' Springer-Verlag, New York, 2000
*Sikorski, K., ''Optimal Solution of Nonlinear Equations,'' Oxford University Press, Oxford, UK, 2001

Extensive bibliographies may be found in the monographs N (1988), TW (1980), TWW (1988) and TW (1998).
The [http://www.ibc-research.org IBC website] has a searchable data base of some 730 items.

==External links==
*[http://www.elsevier.com/wps/find/journaldescription.cws_home/622865/description#description Journal of Complexity]
*[https://www.amazon.com/dp/0521485061/ Complexity and Information]
*[http://www.cs.columbia.edu/~traub/ Joseph Traub]
*[http://octopus.library.cmu.edu/Collections/traub62/box00021/fld00024/bdl0002/doc0001/doc_21b24f2b1.pdf J.F Traub, 1985. An Introduction to Information-Based Complexity] {{Webarchive|url=https://web.archive.org/web/20110823134909/http://octopus.library.cmu.edu/Collections/traub62/box00021/fld00024/bdl0002/doc0001/doc_21b24f2b1.pdf |date=2011-08-23 }}

{{Comp-sci-stub}}

Category:Computational complexity theory

---
Adapted from the Wikipedia article [Information-based complexity](https://en.wikipedia.org/wiki/Information-based_complexity) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Information-based_complexity?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.