Optimal Error Pseudodistributions for Read-Once Branching Programs

02/17/2020
by   Eshan Chattopadhyay, et al.
0

In 1992, Nisan (Combinatorica'92) constructed a pseudorandom generator for length n, width w read-once branching program with error ε and seed length O(log n·log(nw)+log n·log(1/ε)). A central question in complexity theory is to reduce the seed length to O(log (nw/ε)), which will imply BPL=L. However, there has been no improvement on Nisan's construction for the case n=w, which is most relevant to space-bounded derandomization. Recently, in a beautiful work, Braverman, Cohen and Garg (STOC'18) introduced the notion of a pseudorandom pseudo-distribution (PRPD) and gave an explicit construction of a PRPD with seed length Õ(log n·log(nw)+log(1/ε)). A PRPD is a relaxation of a pseudorandom generator, which suffices for derandomizing BPL and also implies a hitting set. Unfortunately, their construction is quite involved and complicated. Hoza and Williams (FOCS'18) later constructed a much simpler hitting set generator with seed length O(log n·log(nw)+log(1/ε)), but their techniques are restricted to hitting sets. In this work, we construct a PRPD with seed length O(log n·log (nw)·loglog(nw)+log(1/ε)). This improves upon the construction in [BCG18] by a O(loglog(1/ε)) factor, and is optimal in the small error regime. In addition, we believe our construction and analysis to be simpler than the work of Braverman, Cohen and Garg.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset