Approximating the Influence of Monotone Boolean Functions in O(√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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity |
scientific article |
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
