View source for Information-based complexity

''IBC''

Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. Discrete computational complexity studies discrete problems and often uses the [[Turing machine|Turing machine]] model of computation. Continuous computational complexity studies continuous problems and tends to use the real number model; see [[#References|[a1]]], [[#References|[a3]]] as well as [[Optimization of computational algorithms|Optimization of computational algorithms]].

Information-based complexity is part of continuous computational complexity. Typically, it studies infinite-dimensional problems for which the input is an element of an infinite-dimensional space. Examples of such problems include multivariate integration or approximation, solution of ordinary or partial differential equations, integral equations, optimization, and solution of non-linear equations. The input of such problems is usually a multivariate function on the real numbers, represented by an oracle (subroutine) which computes, for example, the function value at a given point. This oracle can be used only a finite number of times. That is why only partial information is available when solving an infinite-dimensional problem on a digital computer. This partial information is often contaminated with errors such as round-off errors, measurement errors, or human errors. Thus, the available information is partial and/or contaminated. Therefore, the original problem can be solved only approximately. The goal of information-based complexity is to compute such an approximation at minimal cost. The error and the cost of approximation can be defined in different settings including worst case, average case (see also [[Bayesian numerical analysis|Bayesian numerical analysis]]), probabilistic, randomized (see also [[Monte-Carlo method|Monte-Carlo method]]; [[Stochastic numerical algorithm|Stochastic numerical algorithm]]) and mixed settings.

The <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200302.png" />-complexity is defined as the minimal cost of computing an approximation with error at most <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200303.png" />. For many problems, sharp complexity bounds are obtained by studying only the information cost.

Information-based complexity is a branch of computational complexity and is formulated as an abstract theory with applications in many areas. Since continuous computational problems are of interest in many fields, information-based complexity has common interests and has greatly benefited from these fields. Questions, concepts, and results from approximation theory, numerical analysis, applied mathematics, statistics, complexity theory, algorithmic analysis, number theory, analysis and measure theory have all been influential. See also [[#References|[a2]]], [[#References|[a4]]], [[#References|[a5]]], [[#References|[a6]]], [[#References|[a8]]].

Recent emphasis in information-based complexity is on the study of complexity of linear multivariate problems involving functions of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200304.png" /> variables with large or even infinite <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200305.png" />. For example, for path integration one has <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200306.png" />, while the approximation of path integrals yields multivariate integration with huge <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200307.png" />, see [[#References|[a7]]].

Linear multivariate problems are studied in various settings. The main question is to check which linear multivariate problems are tractable, i.e., their complexity is polynomial in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200308.png" /> and in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i1200309.png" />. The [[Smolyak algorithm|Smolyak algorithm]], or a modification of it, is often near optimal for general multivariate problems defined over tensor product spaces. Some of such problems are tractable even in the worst-case setting.

In the worst-case setting, many multivariate problems defined over isotropic spaces are intractable. This means that they suffer the [[Curse of dimension|curse of dimension]], since their complexity is an exponential function of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/i/i120/i120030/i12003010.png" />. The curse of dimension can be sometimes broken by switching to another setting, such as an average case or randomized setting, or by shrinking the class of input functions.

====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  L. Blum,   M. Shub,   S. Smale,   "On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines"  ''Bull. Amer. Math. Soc.'' , '''21'''  (1989)  pp. 1–46</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  E. Novak,   "Deterministic and stochastic error bounds in numerical analysis" , ''Lecture Notes Math.'' , '''1349''' , Springer  (1988)</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top">  E. Novak,   "The real number model in numerical analysis"  ''J. Complexity'' , '''11'''  (1995)  pp. 57–73</TD></TR><TR><TD valign="top">[a4]</TD> <TD valign="top">  L. Plaskota,   "Noisy information and computational complexity" , Cambridge Univ. Press  (1996)</TD></TR><TR><TD valign="top">[a5]</TD> <TD valign="top">  J.F. Traub,   G.W. Wasilkowski,   H. Woźniakowski,   "Information-based complexity" , Acad. Press  (1988)</TD></TR><TR><TD valign="top">[a6]</TD> <TD valign="top">  J.F. Traub,   A.G. Werschulz,   "Complexity and information" , Cambridge Univ. Press  (1998)</TD></TR><TR><TD valign="top">[a7]</TD> <TD valign="top">  G.W. Wasilkowski,   H. Woźniakowski,   "On tractability of path integration"  ''J. Math. Phys.'' , '''37'''  (1996)  pp. 2071–2088</TD></TR><TR><TD valign="top">[a8]</TD> <TD valign="top">  A.G. Werschulz,   "The computational complexity of differential and integral equations: An information-based approach" , Oxford Univ. Press  (1991)</TD></TR></table>