Pages that link to "Item:Q3088135"
From MaRDI portal
The following pages link to Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135):
Displaying 4 items.
- Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
- An \(o(n)\) monotonicity tester for Boolean functions over the hypercube (Q2805510) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)