Almost κ-wise independent sets establish hitting sets for width-3 1-branching programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6651 LNCS, Issue , 2011, Pages 120-133

  Šíma, Jiří ^a   Žák, Stanislav ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED COMPUTATION; BRANCHING PROGRAMS; DERANDOMIZING; FUNDAMENTAL PROBLEM; HITTING SET GENERATORS; HITTING SETS; INDEPENDENT SET; POLYNOMIAL-TIME; PSEUDO RANDOM; READ-ONCE BRANCHING PROGRAMS;

POLYNOMIAL APPROXIMATION;

COMPUTATION THEORY;

EID: 79959304214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20712-9_10     Document Type: Conference Paper

References (14)

1. Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289-304 (1992).
2. Bogdanov, A., Dvir, Z., Verbin, E., Yehudayoff, A.: Pseudorandomness for width 2 branching programs. ECCC Report No.70 (2009).
3. Braverman, M., Rao, A., Raz, R., Yehudayoff, A.: Pseudorandom generators for regular branching programs. In: Proceedings of the FOCS 2010 Fifty-First Annual IEEE Symposium on Foundations of Computer Science, pp. 41-50 (2010).
4. Brody, J., Verbin, E.: The coin problem, and pseudorandomness for branching programs. In: Proceedings of the FOCS 2010 Fifty-First Annual IEEE Symposium on Foundations of Computer Science, pp. 30-39 (2010).
5. De, A., Etesami, O., Trevisan, L., Tulsiani, M.: Improved pseudorandom generators for depth 2 circuits. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010, LNCS, vol. 6302, pp. 504-517. Springer, Heidelberg (2010).
6. Goldreich, O., Wigderson, A.: Improved derandomization of BPP using a hitting set generator. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 131-137. Springer, Heidelberg (1999).
7. Koucḱy, M., Nimbhorkar, P., Pudĺak, P.: Pseudorandom generators for group products. To appear in Proceedings of the STOC 2011 Forty-Third ACM Symposium on Theory of Computing. ACM, New York (2011).
8. Meka, R., Zuckerman, D.: Pseudorandom generators for polynomial threshold functions. In: Proceedings of the STOC 2010 Forty-Second ACM Symposium on Theory of Computing, pp. 427-436. ACM, New York (2010).
9. Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449-461 (1992).
10. Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences 49(2), 149-167 (1994).
11. Śma, J., Žák, S.: A polynomial time constructible hitting set for restricted 1-branching programs of width 3. In: Van Leeuwen, J., Italiano, G.F., Van der Hoek, W., Meinel, C., Sack, H., Pĺasil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 522-531. Springer, Heidelberg (2007).
12. Śma, J., Žák, S.: A polynomial time construction of a hitting set for read-once branching programs of width 3. ECCC Report No. 88 (2010).
13. Śma, J., Žák, S.: A sufficient condition for sets hitting the class of read-once branching programs of width 3 (submitted).
14. Wegener, I.: Branching Programs and Binary Decision Diagrams-Theory and Applications. SIAM Monographs on Discrete Mathematics and Its Applications. SIAM, Philadelphia (2000)