Next: Tiny Families of Functions
Up: The Technion Period (1986-94)
Previous: Asynchronous Secure Computation
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
- IPL, Vol. 53, pp. 17-25, 1995.
Oded Goldreich
2003-07-30