Advertisement
Published in:
2014 | OriginalPaper | Chapter
Continuous Problems: Optimality, Complexity, Tractability (Invited Talk)
Author : Leszek Plaskota
Published in: Computer Algebra in Scientific Computing
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Information-based complexity
(
IBC
) is a branch of computational complexity that studies continuous problems for which available information is partial, noisy, and priced. We present basic ideas of IBC and give some important results on optimal algorithms, complexity, and tractability of such problems. The focus is on numerical integration of univariate and multivariate functions.