How Many Random Bits Do We Need for Monte Carlo Integration?-Reference-Cited by-同舟云学术

How Many Random Bits Do We Need for Monte Carlo Integration?

Published:2004 Issue: Volume: Page:27-49
ISSN:
Container-title:Monte Carlo and Quasi-Monte Carlo Methods 2002
language:
Short-container-title:

Author:

Heinrich Stefan,Novak Erich,Pfeiffer Harald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18743-8_2.pdf

Reference25 articles.

1. Adams, R.A.: Sobolev Spaces. Academic Press, New York (1975)

2. Bakhvalov, N.S.: On approximate computation of integrals. Vestnik Moskov. Gos. Univ. Ser. Math. Mech. Astron. Phys. Chem., 4, 3–18 (1959) [In Russian]

3. Bakhvalov, N.S.: On the rate of convergence of indeterministic integration processes within the functional classes W p (l). Theory Probab. Appl., 7, 227 (1962)

4. Bakhvalov, N.S.: Optimal convergence bounds for quadrature processes and integration methods of Monte Carlo type for classes of functions. Ž. Vyčisl. Mat. i Mat. Fiz., 4, suppl. 5-63 (1964) [In Russian]

5. Bakhvalov, N.S.: A lower bound for the randomness measure required in the use of the Monte-Carlo method. U.S.S.R. Comput. Math. Math. Phys. 5(4), 252–257 (1965)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms;Springer Proceedings in Mathematics & Statistics;2022

2. On the Power of Restricted Monte Carlo Algorithms;2018 MATRIX Annals;2020

3. Random Bit Quadrature and Approximation of Distributions on Hilbert Spaces;Foundations of Computational Mathematics;2018-03-21

4. Some Results on the Complexity of Numerical Integration;Springer Proceedings in Mathematics & Statistics;2016

5. Quantum Algorithms for Continuous Problems and Their Applications;Advances in Chemical Physics;2014-03-21