eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-06-04
1:1
1:21
10.4230/LIPIcs.CCC.2018.1
article
Pseudorandom Generators from Polarizing Random Walks
Chattopadhyay, Eshan
1
Hatami, Pooya
2
Hosseini, Kaave
3
Lovett, Shachar
3
Cornell Univeristy and IAS, Princeton, USA
University of Texas at Austin, USA
University of California, San Diego, USA
We propose a new framework for constructing pseudorandom generators for n-variate Boolean functions. It is based on two new notions. First, we introduce fractional pseudorandom generators, which are pseudorandom distributions taking values in [-1,1]^n. Next, we use a fractional pseudorandom generator as steps of a random walk in [-1,1]^n that converges to {-1,1}^n. We prove that this random walk converges fast (in time logarithmic in n) due to polarization. As an application, we construct pseudorandom generators for Boolean functions with bounded Fourier tails. We use this to obtain a pseudorandom generator for functions with sensitivity s, whose seed length is polynomial in s. Other examples include functions computed by branching programs of various sorts or by bounded depth circuits.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol102-ccc2018/LIPIcs.CCC.2018.1/LIPIcs.CCC.2018.1.pdf
AC0
branching program
polarization
pseudorandom generators
random walks
Sensitivity