Pseudorandomness for permutation and regular branching programs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 221-231

  De, Anindya ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Branching programs; Expander products; INW generator

Indexed keywords

BRANCHING PROGRAMS; EXPANDER PRODUCTS; GROUP THEORETIC METHOD; INW GENERATOR; LINEAR-ALGEBRAIC; PERMUTATION BRANCHING PROGRAMS; PROBABILISTIC METHODS; PROOF METHODS; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS;

ALGEBRA; INFORMATION THEORY; SEED;

COMPUTATIONAL COMPLEXITY;

EID: 80052007561     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.23     Document Type: Conference Paper

References (22)

1. M. Koucký, P. Nimbhorkar, and P. Pudlák, "Pseudorandomness for group products," in Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011.
2. M. Braverman, A. Rao, R. Raz, and A. Yehudayoff, "Pseudorandom generators for regular branching programs," in Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010, pp. 40-47.
3. J. Brody and E. Verbin, "The Coin Problem and pseudorandomness for Branching programs," in Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, 2010, pp. 30-39.
4. R. Meka and D. Zuckerman, "Small-Bias Spaces for Group Products," in Proceedings of APPROX-RANDOM, 2009, pp. 658-672.
5. A. C. Yao, "Theory and applications of trapdoor functions," in Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, 1982, pp. 80-91.
6. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudorandom bits," SIAM Journal on Computing, vol. 13, no. 4, pp. 850-864, 1984, preliminary version in Proc. of FOCS'82. (Pubitemid 15510668)
7. N. Nisan and A. Wigderson, "Hardness vs randomness," Journal of Computer and System Sciences, vol. 49, pp. 149-167, 1994, preliminary version in Proc. of FOCS'88. (Pubitemid 124013312)
8. R. Impagliazzo and A. Wigderson, "P = BPP unless E has sub-exponential circuits," in Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 220-229.
9. V. Kabanets and R. Impagliazzo, "Derandomizing polynomial identity tests means proving circuit lower bounds," Computational Complexity, vol. 13, no. 1-2, pp. 1-46, 2004. (Pubitemid 41217703)
10. W. J. Savitch, "Relationships between nondeterministic and deterministic tape complexities," Journal of Computer and System Sciences, vol. 4, no. 2, pp. 177-192, 1970.
11. N. Nisan, "Pseudorandom generators for space bounded computation," Combinatorica, vol. 12, no. 4, pp. 449-461, 1992, preliminary version in Proc. of STOC'90.
12. 1," Journal of Computer and System Sciences, vol. 38, no. 1, pp. 150-164, 1989.
13. R. Impagliazzo, N. Nisan, and A. Wigderson, "Pseudoran-domness for network algorithms," in Proceedings of the 26th ACM Symposium on Theory of Computing, 1994, pp. 356-364.
14. R. Raz and O. Reingold, "On recycling randomness in space bounded computation," in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, pp. 159-168.
15. C.-J. Lu, "Improved Pseudorandom Generators for Combinatorial Rectangles," Combinatorica, vol. 22, no. 3, pp. 417-434, 2002.
16. S. Lovett, O. Reingold, L. Trevisan, and S. P. Vadhan, "Pseudorandom Bit Generators That Fool Modular Sums," in APPROX-RANDOM, 2009, pp. 615-630.
17. P. Gopalan, R. Meka, O. Reingold, and D. Zuckerman, "Pseudorandom Generators for Combinatorial Shapes," Electronic Colloquium on Computational Complexity, Tech. Rep. TR10-176, 2010.
18. J. Šíma and S. Žák, "A Polynomial time construction of Hitting set for read-once branching programs of width 3." Electronic Colloquium on Computational Complexity, Tech. Rep. TR10-088, 2010.
19. E. Rozenman and S. Vadhan, "Derandomized squaring of graphs," in Proceedings of RANDOM'05. Springer-Verlag, 2005, pp. 436-447. (Pubitemid 41480454)
20. O. Reingold, "Undirected ST-connectivity in log-space," in Proceedings of the 37th ACM Symposium on Theory of Computing, 2005, pp. 376-385. (Pubitemid 43098608)
21. O. Reingold, S. P. Vadhan, and A. Wigderson, "Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors," in Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, 2000.
22. J. Kahn, G. Kalai, and N. Linial, "The Influence of Variables on Boolean Functions," in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 68-80.