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.
Cite
CITATION STYLE
Traub, J. F. (1991). Information-based complexity: Recent results and open problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 529 LNCS, pp. 86–88). Springer Verlag. https://doi.org/10.1007/3-540-54458-5_52
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
