Pseudorandom Generators for Width-3 Branching Programs

Electronic Colloquium on Computational Complexity (ECCC), Volume 25, 2018, Pages 112-637.

Cited by: 9|Bibtex|Views41|Links
EI
Keywords:
epsilon-biased generator pseudorandom generators for small-space computation pseudorandom generators for space-bounded computation random restrictions read once branching programs

Abstract:

We construct pseudorandom generators of seed length Õ(log(n)· log(1/є)) that є-fool ordered read-once branching programs (ROBPs) of width 3 and length n. For unordered ROBPs, we construct pseudorandom generators with seed length Õ(log(n) · poly(1/є)). This is the first improvement for pseudorandom generators fooling width 3 ROBPs since th...More

Code:

Data:

Your rating :
0

 

Tags
Comments