On the power of random information
From MaRDI portal
Publication:6314919
Complexity and performance of numerical algorithms (65Y20) Numerical quadrature and cubature formulas (65D32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Algorithms for approximation of functions (65D15) Asymptotic theory of convex bodies (52A23)
Abstract: We study approximation and integration problems and compare the quality of optimal information with the quality of random information. For some problems random information is almost optimal and for some other problems random information is much worse than optimal information. We prove new results and give a short survey of known results.
This page was built for publication: On the power of random information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314919)
