Lower bounds for sampling algorithms for estimating the average
- 13 January 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 53 (1) , 17-25
- https://doi.org/10.1016/0020-0190(94)00171-t
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Private vs. common random bits in communication complexityInformation Processing Letters, 1991
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963