Pseudorandom Generators for Low-Sensitivity Functions

A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We initiate the study of pseudorandom generators fooling low-sensitivity functions as an intermediate step towards settling the sensitivity conjecture. We construct a pseudorandom generator with seed-length 2^{O(s^{1/2})} log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the (implicitly) best pseudorandom generators for this class of functions required seed-length 2^{O(s)} log(n).

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

[2]  Avishay Tal,et al.  Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..

[3]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[5]  Louay Bazzi,et al.  Polylogarithmic Independence Can Fool DNF Formulas , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[6]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  Avishay Tal,et al.  Degree and Sensitivity: tails of two distributions , 2016, Electron. Colloquium Comput. Complex..

[8]  Hans Ulrich Simon.  A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions , 1982, Inf. Control..

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

[10]  Luca Trevisan,et al.  A Derandomized Switching Lemma and an Improved Derandomization of AC0 , 2013, 2013 IEEE Conference on Computational Complexity.

[11]  Mark Braverman.  Poly-logarithmic Independence Fools AC0 Circuits , 2009, Computational Complexity Conference.

[12]  Mark Braverman,et al.  Poly-logarithmic Independence Fools AC^0 Circuits , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[13]  Thomas Steinke,et al.  Pseudorandomness for Regular Branching Programs via Fourier Analysis , 2013, APPROX-RANDOM.

[14]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[15]  Avi Wigderson,et al.  Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version) , 1985, FOCS 1985.

[16]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[17]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

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