Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:06, 5 March 2024
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
