Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
From MaRDI portal
Publication:2875180
DOI10.1145/1806689.1806763zbMath1294.68083OpenAlexW1997142544MaRDI QIDQ2875180
Adam R. Klivans, Prahladh Harsha, Prasad Raghavendra, Li-Yang Tan, Raghu Meka, Ilias Diakonikolas, Rocco A. Servedio
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806763
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ The average sensitivity of an intersection of half spaces ⋮ The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions ⋮ The correct exponent for the Gotsman-Linial conjecture ⋮ Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity ⋮ Concentration and Moment Inequalities for Polynomials of Independent Random Variables
This page was built for publication: Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
