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, Rubinfeld, Ronitt, Safra, Muli, Weinstein, Omri
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Springer Berlin / Heidelberg 2012
Online Access:http://hdl.handle.net/1721.1/73917
https://orcid.org/0000-0002-4353-7639

Internet

http://hdl.handle.net/1721.1/73917
https://orcid.org/0000-0002-4353-7639

Similar Items