next up previous
Next: Tiny Families of Functions Up: The Technion Period (1986-94) Previous: Asynchronous Secure Computation

Lower Bounds for Sampling Algorithms for Estimating the Average

This work provides lower bounds on the randomness and query complexities of algorithms for estimating the average of (bounded) functions.


Comments: Authored by R. Canetti, G. Even and O. Goldreich. Appeared in



Oded Goldreich
2003-07-30