The Robust Sensitivity of Boolean Functions

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 1822-1833, 2018.

Cited by: 4|Bibtex|Views6|Links
EI

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...More

Code:

Data:

Your rating :
0

 

Tags
Comments