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
关键词
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 条
  • [21] Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions
    Gopalan, Parikshit
    Nisan, Noam
    Servedio, Rocco A.
    Talwar, Kunal
    Wigderson, Avi
    [J]. ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE, 2016, : 59 - 70
  • [22] Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
    Ehud Friedgut
    [J]. Combinatorica, 1998, 18 : 27 - 35
  • [23] Boolean functions with low average sensitivity depend on few coordinates
    Friedgut, E
    [J]. COMBINATORICA, 1998, 18 (01) : 27 - 35
  • [24] On the Noise Sensitivity and Mutual Information of (Nested-) Canalizing Boolean Functions
    Klotz, Johannes Georg
    Bossert, Martin
    Schober, Steffen
    [J]. 2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
  • [25] BOOLEAN EQUATIONS AND DECOMPOSITION OF BOOLEAN FUNCTIONS
    ROZENFELD, TK
    SILAYEV, VN
    [J]. ENGINEERING CYBERNETICS, 1979, 17 (01): : 85 - 92
  • [26] Almost Boolean functions: The design of Boolean functions by spectral inversion
    Clark, JA
    Jacob, JL
    Maitra, S
    Stanica, P
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 2173 - 2180
  • [27] Almost Boolean functions: The design of Boolean functions by spectral inversion
    Clark, JA
    Jacob, JL
    Maitra, S
    Stanica, P
    [J]. COMPUTATIONAL INTELLIGENCE, 2004, 20 (03) : 450 - 462
  • [28] GRAPH FUNCTIONS OF BOOLEAN FUNCTIONS
    REISCHER, C
    SIMOVICI, DA
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (01) : 97 - 99
  • [29] Nonconservative Robust Control: Optimized and Constrained Sensitivity Functions
    Fransson, Carl-Magnus
    Wik, Torsten
    Lennartson, Bengt
    Saunders, Michael
    Gutman, Per-Olof
    [J]. IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2009, 17 (02) : 298 - 308
  • [30] Sensitivity of Boolean formulas
    Creignou, Nadia
    Daude, Herve
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (05) : 793 - 805