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
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
Hi-index | 0.00 |
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental problem of derandomizing space bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In our previous work, we have introduced a so-called richness condition which is, in a certain sense, sufficient for a set to be a hitting set for read-once branching programs of width 3. In this paper, we prove that, for a suitable constant C, any almost C log n-wise independent set satisfies this richness condition. Hence, we achieve an explicit polynomial time construction of a hitting set for read-once branching programs of width 3 with the acceptance probability greater than √12/13 by using the result due to Alon et al. (1992).