Journal of Computer and System Sciences
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Improved Derandomization of BPP Using a Hitting Set Generator
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The Coin Problem and Pseudorandomness for Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Pseudorandom Generators for Regular Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Pseudorandomness for Permutation and Regular Branching Programs
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
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
| Hi-index | 0.00 |
We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. The richness property proves to be (in certain sense) necessary and sufficient condition for such hitting sets. In particular, we show that any rich set extended with all strings within Hamming distance of 3 is a hitting set for width-3 read-once branching programs. Applying this result to an example of an efficiently constructible rich set from our previous work we achieve an explicit polynomial time construction of an ε -hitting set for read-once branching programs of width 3 with acceptance probability ε 11/12.