Abstract
The sensitivity conjecture is one of the central open problems in Boolean complexity. A recent work of Gopalan et al. [CCC 2016] conjectured a robust analog of the sensitivity conjecture, which relates the decay of the Fourier mass of a Boolean function to moments of its sensitivity. We prove the robust sensitivity conjecture in this work with near optimal parameters.
Cite
CITATION STYLE
APA
Lovett, S., Tal, A., & Zhang, J. (2018). The robust sensitivity of boolean functions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1822–1833). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.119
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free