The Robust Sensitivity of Boolean Functions

被引：0
|
作者：
Lovett, Shachar [1 ]
Tal, Avishay [2 ]
Zhang, Jiapeng [1 ]
机构：
[1] Univ Calif San Diego, La Jolla, CA 92093 USA
[2] Stanford Univ, Stanford, CA 94305 USA
来源：
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2018年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：1822 / 1833
页数：12
相关论文
共 50 条
12345