How many random bits do we need for Monte Carlo integration?
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2186130
- Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes
- A universal algorithm for multivariate integration
- scientific article; zbMATH DE number 953025
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
Cited in
(12)- Random bit quadrature and approximation of distributions on Hilbert spaces
- Random bit multilevel algorithms for stochastic differential equations
- Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
- Some results on the complexity of numerical integration
- scientific article; zbMATH DE number 2186130 (Why is no real title available?)
- On the Power of Restricted Monte Carlo Algorithms
- Mathematical Foundations of Computer Science 2005
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
- Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms
- Optimal restricted Monte Carlo integration on generalized Hölder classes
- The quantum setting with randomized queries for continuous problems
This page was built for publication: How many random bits do we need for Monte Carlo integration?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453499)
