Pseudorandom generators for group products

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 263-272

  Koucký, Michal ^a   Nimbhorkar, Prajakta ^b   Pudlák, Pavel ^a  

^a INSTITUTE OF MATHEMATICS   (Czech Republic)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

bounded width branching programs; pseudorandom generators; randomized group product; small bias spaces

Indexed keywords

COMPUTATION THEORY;

BOUNDED-WIDTH BRANCHING PROGRAM; CHOICE OF PARAMETERS; FINITE GROUPS; PERMUTATION BRANCHING PROGRAMS; PSEUDORANDOM GENERATORS; RANDOMIZED GROUP PRODUCT; SMALL-BIAS SPACES;

APPLICATION PROGRAMS;

EID: 79959722170     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993672     Document Type: Conference Paper

References (23)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple construction of almost k-wise independent random variables. Random Structures and Alg., 3(3):289-304, 1992.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Deterministic simulation in logspace. In Proc. of ACM Symp. on Theory of Computing (STOC), pages 132-140, 1987.
3. Y. Azar, R. Motwani, and J. Naor. Approximating arbitrary probability distributions using small sample spaces. Combinatorica, 18:151-171, 1998. (Pubitemid 128341488)
4. N. Alon and J. Spencer. The Probabilistic Method. John Wiley, 1992.
5. 1. J. of Comp. and System Sci., 38(1):150-164, 1989.
6. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols and logspace-hard pseudorandom sequences (extended abstract). In Proc. of ACM Symp. on Theory of Computing (STOC), pages 1-11, 1989.
7. M. Braverman, A. Rao, R. Raz, and A. Yehudayo. Pseudorandom generators for regular branching programs. In Proc. of Symp. on Foundations of Computer Science (FOCS), pages 40-47, 2010.
8. J. Brody and E. Verbin. The coin problem, and pseudorandomness for branching programs. In Proc. of the fifty first annual Symp. on Foundations of Computer Science (FOCS), pages 30-39, 2010.
9. O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators. J. of Comp. and System Sci., 22(3):407-420, 1981.
10. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proc. of ACM Symp. on Theory of Computing (STOC), pages 356-364, 1994.
11. L. Lovász. Combinatorial Problems and Exercises. Akadémiai Kiadó, Budapest, 1993.
12. S. Lovett, O. Reingold, L. Trevisan, and S. P. Vadhan. Pseudorandom bit generators that fool modular sums. In APPROX-RANDOM, pages 615-630, 2009.
13. R. Meka and D. Zuckerman. Small-bias spaces for group products. In APPROX-RANDOM, pages 658-672, 2009.
14. N. Nisan. Pseudorandom generators for space-bounded computations. Combinatorica, 12(4):449-461, 1992.
15. N. Nisan. RL⊆ SC. Computational Complexity, 4(1):1-11, 1994.
16. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. on Computing, 22(4):838-856, 1993. (Pubitemid 23677151)
17. N. Nisan and D. Zuckerman. Randomness is linear in space. J. of Comp. and System Sci., 52(1):43-52, 1996. (Pubitemid 126340848)
18. R. Raz and O. Reingold. On recycling the randomness of states in space bounded computation. In Proc. of ACM Symp. on Theory of Computing (STOC), pages 159-168, 1999.
19. E. Rozenman and S.P. Vadhan. Derandomized squaring of graphs. In APPROX-RANDOM, pages 436-447, 2005.
20. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Annals of Mathematics, pages 157-187, 2000.
21. W.J. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. of Comp. and System Sci., 4(2):177-192, 1970.
22. 3/2). J. of Comp. and System Sci., 58(2):376-403, 1999.
23. J. Šíma and S. Žák. A polynomial time construction of a hitting set for read-once branching programs of width 3. Technical Report TR10-088, Electronic Colloquium on Computational Complexity (ECCC), 2010.