Approximating the Noise Sensitivity of a Monotone Boolean Function
From MaRDI portal
Cites work
- A polynomial lower bound for testing monotonicity
- Agnostically Learning Halfspaces
- An o(n) monotonicity tester for Boolean functions over the hypercube
- Analysis of Boolean Functions
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- Average sensitivity and noise sensitivity of polynomial threshold functions
- Coin flipping from a cosmic source: On error correction of truly random bits
- Hardness amplification within NP
- How much are increasing sets positively correlated?
- scientific article; zbMATH DE number 5485510 (Why is no real title available?)
- Learning intersections and thresholds of halfspaces
- Noise sensitivity of Boolean functions and applications to percolation
- Noise stability of weighted majority
- On the noise sensitivity of monotone functions
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Polynomial regression under arbitrary product distributions
- Quantitative relation between noise sensitivity and influences
- Submodular functions are noise stable
- The average sensitivity of an intersection of half spaces
- The Gaussian surface area and noise sensitivity of degree-d polynomial threshold functions
Cited in
(2)
This page was built for publication: Approximating the Noise Sensitivity of a Monotone Boolean Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875511)
