Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity
STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 363-375, 2018.
Branching programsFourier analysispseudorandom generatorssmall-space computationspace-bounded computationMore(1+)
We present an explicit pseudorandom generator with seed length Õ((logn)w+1) for read-once, oblivious, width w branching programs that can read their input bits in any order. This improves upon the work of Impagliazzo, Meka and Zuckerman (FOCS’12) where they required seed length n1/2+o(1). A central ingredient in our work is the followin...More
Full Text (Upload PDF)
PPT (Upload PPT)