Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

by Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein

Published in ACM Transactions on Computation Theory by Association for Computing Machinery (ACM).

2012 p1-12

application/pdf 136.2 kB `file_zvyf5s652jfrdivq4y664h6zqy`
application/pdf 212.1 kB `file_lwedg4hbd5fp5pok3rjsjjgcgq`	web.archive.org (webarchive) www.eng.tau.ac.il:80 (web)

Preserved and Accessible

Type article-journal
Stage

published

Date 2012-11-01
Language en ^?

DOI 10.1145/2382559.2382562

Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L: 1942-3454

Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

Cite This

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar

Catalog Record
Revision: 1deaa97b-9d95-4ca8-899c-83cb09e83981
API URL: JSON

Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity release_qfookvmparhxtfrrg234jlhsf4