Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Almost k-wise independent sets establish hitting sets for width-3 1-branching programs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
A sufficient condition for sets hitting the class of read-once branching programs of width 3
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
We give new pseudorandom generators for \emph{regular} read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either $0$ or $2$. For every width $d$ and length $n$, our pseudorandom generator uses a seed of length $O((\log d + \log\log n + \log(1/\epsilon))\log n)$ to produce $n$ bits that cannot be distinguished from a uniformly random string by any regular width $d$ length $n$ read-once branching program, except with probability $\epsilon$. We also give a result for general read-once branching programs, in the case that there are no vertices that are reached with small probability. We show that if a (possibly non-regular) branching program of length $n$ and width $d$ has the property that every vertex in the program is traversed with probability at least $\gamma$ on a uniformly random input, then the error of the generator above is at most $2 \epsilon/\gamma^2$.