Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity (Q2947571)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating the influence of monotone Boolean functions in O(n) query complexity |
scientific article; zbMATH DE number 6485181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity |
scientific article; zbMATH DE number 6485181 |
Statements
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (English)
0 references
24 September 2015
0 references
influence of a Boolean function
0 references
sublinear query approximation algorithms
0 references
symmetric chains
0 references
0.9933847784996032
0 references
0.7962402701377869
0 references
0.7913745641708374
0 references
0.7903825044631958
0 references
