On the Sensitivity Conjecture for Disjunctive Normal Forms

The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open. In this paper, we consider a restriction on the class of Boolean functions through a model of computation (DNF), and refer to the functions adhering to this restriction as admitting the Normalized Block property. We prove that for any function $f$ admitting the Normalized Block property, $bs(f) \leq 4s(f)^2$. We note that (almost) all the functions mentioned in literature that achieve a quadratic separation between sensitivity and block sensitivity admit the Normalized Block property. Recently, Gopalan et al. [ITCS '16] showed that every Boolean function $f$ is uniquely specified by its values on a Hamming ball of radius at most $2s(f)$. We extend this result and also construct examples of Boolean functions which provide the matching lower bounds.

[1]  György Turán,et al.  The Critical Complexity of Graph Properties , 1984, Information Processing Letters.

[2]  Stephen A. Cook,et al.  Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.

[3]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[4]  Sourav Chakraborty.  On the sensitivity of cyclically-invariant Boolean functions , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[5]  David Rubinstein.  Sensitivity vs. block sensitivity of Boolean functions , 1995, Comb..

[6]  Andris Ambainis,et al.  New separation between s(f) and bs(f) , 2011, Electron. Colloquium Comput. Complex..

[7]  Andris Ambainis,et al.  Tighter Relations between Sensitivity and Other Complexity Measures , 2014, ICALP.

[8]  Andris Ambainis,et al.  A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity , 2014, MFCS.

[9]  Michael E. Saks,et al.  Composition limits and separating examples for some boolean function complexity measures , 2013, 2013 IEEE Conference on Computational Complexity.

[10]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[11]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[12]  Andrew Drucker.  Block sensitivity of minterm-transitive functions , 2011, Theor. Comput. Sci..

[13]  Claire Mathieu,et al.  Sensitivity, block sensitivity, and l-block sensitivity of boolean functions , 2004, Inf. Comput..

[14]  Madars Virza.  Sensitivity versus block sensitivity of Boolean functions , 2011, Inf. Process. Lett..

[15]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.

[16]  Ingo Wegener.  The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties , 1985, Inf. Control..

[17]  Shengyu Zhang,et al.  Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers , 2017, ICALP.

[18]  Xiaoming Sun.  Block sensitivity of weakly symmetric functions , 2007, Theor. Comput. Sci..

[19]  Rocco A. Servedio,et al.  Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions , 2015, ITCS.

[20]  Satyanarayana V. Lokam,et al.  On the Sensitivity Conjecture for Read-k Formulas , 2016, MFCS.

[21]  Pooya Hatami,et al.  Variations on the Sensitivity Conjecture , 2011, Theory Comput..