Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms

DOI10.1007/978-3-030-98319-2_6arXiv2012.12774OpenAlexW3114990569MaRDI QIDQ6194479

No author found.

Publication date: 14 February 2024

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.12774

zbMATH Keywords

integrationlower boundscomplexity theoryWiener spacerandom bit

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite-dimensional quadrature and approximation of distributions
• Deterministic and stochastic error bounds in numerical analysis
• 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
• Monte Carlo approximation of weakly singular integral operators
• The randomized information complexity of elliptic PDE
• 2. An adaptive random bit multilevel algorithm for SDEs
• The Monte Carlo Algorithm with a Pseudorandom Generator
• Coin Tossing Algorithms for Integral Equations and Tractability
• On the Power of Restricted Monte Carlo Algorithms
• Stochastic Approximation of Functions and Applications

This page was built for publication: Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms