Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2382559.2382562 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170827767 / rank | |||
Normal rank | |||
Latest revision as of 20:55, 19 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
