Approximating the influence of monotone boolean functions in O(√n) query complexity

Approximating the influence of monotone boolean functions in O(√n) query complexity

Author Manuscript received 27 Jan 2011. 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings

Bibliographic Details
Main Authors: Ron, Dana (Author), Rubinfeld, Ronitt (Contributor), Safra, Muli (Author), Weinstein, Omri (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer Berlin / Heidelberg, 2012-10-12T14:26:36Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items