Pseudorandom generators for regular branching programs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 40-47

  Braverman, Mark ^a   Rao, Anup ^b   Raz, Ran ^c   Yehudayoff, Amir ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Branching programs; Explicit constructions; Pseudorandomness

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BRANCHING PROGRAMS; EXPLICIT CONSTRUCTIONS; IN-DEGREE; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; RANDOM INPUT; RANDOM STRING; READ-ONCE BRANCHING PROGRAMS;

PROBABILITY;

EID: 78751520954     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.11     Document Type: Conference Paper

References (15)

1. Noga Alon, Oded Goldreich, Johan Håstad, and René Peralta. Simple construction of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-304, 1992.
2. Miklós Ajtai, János Komlós, and Endre Szemerédi. Deterministic simulation in LOGSPACE. In STOC, pages 132-140. ACM, 1987.
3. 1. Journal of Computer and System Sciences, 38(1):150-164, February 1989.
4. László Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and logspace-hard pseudorandom sequences (extended abstract). In STOC, pages 1-11. ACM, 1989.
5. Oded Goldreich and Avi Wigderson. Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Algorithms, 11(4):315-343, 1997.
6. Russell Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In STOC, pages 356-364, 1994.
7. Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
8. Noam Nisan. RL ⊆ SC. Computational Complexity, 4:1-11, 1994.
9. Joseph Naor and Moni Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, August 1993.
10. Noam Nisan and David Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
11. Ran Raz and Omer Reingold. On recycling the randomness of states in space bounded computation. In STOC, pages 159-168, 1999.
12. Omer Reingold, Luca Trevisan, and Salil Vadhan. Pseudorandom walks on regular digraphs and the RL vs. L problem. In STOC, pages 457-466. ACM, 2006.
13. Walter J. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci, 4(2):177-192, 1970.
14. Michael Saks and David Zuckerman. Personal communication.
15. 3/2). J. Comput. Syst. Sci, 58(2):376-403, 1999.