Abstract
Purchase PDF (655 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (18)
Purchase PDF (624 K)
doi:10.1016/0020-0190(94)00171-T 
Copyright © 1995 Published by Elsevier Science B.V.
Lower bounds for sampling algorithms for estimating the average*1
Received 8 November 1993;
revised 15 September 1994.
Communicated by J. Håstad
Available online 5 April 2000.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We show lower bounds on the number of sample points and on the number of coin tosses used by general sampling algorithms for estimating the average value of functions over a large domain. The bounds depend on the desired precision and on the error probability of the estimate.
Our lower bounds match upper bounds established by known algorithms, up to a multiplicative constant. Furthermore, we give a non-constructive proof of existence of an algorithm that improves the known upper bounds by a constant factor.
Author Keywords: Theory of computation; Sampling; Estimating; Randomness; Lower bounds
