Pages that link to "Item:Q2947571"
From MaRDI portal
The following pages link to Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571):
Displaying 4 items.
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces (Q5002641) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)
