Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > EDWARD PYNE:
All reports by Author Edward Pyne:

TR20-138 | 9th September 2020
William Hoza, Edward Pyne, Salil Vadhan

Pseudorandom Generators for Unbounded-Width Permutation Branching Programs

We prove that the Impagliazzo-Nisan-Wigderson (STOC 1994) pseudorandom generator (PRG) fools ordered (read-once) permutation branching programs of unbounded width with a seed length of $\widetilde{O}(\log d + \log n \cdot \log(1/\varepsilon))$, assuming the program has only one accepting vertex in the final layer. Here, $n$ is the length of the ... more >>>




ISSN 1433-8092 | Imprint