Randomness is linear in space

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 43-52

  Nisan, Noam ^a   Zuckerman, David ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SIMULATION; ERRORS; FORMAL LANGUAGES; POLYNOMIALS; STATISTICAL METHODS;

PSEUDO RANDOM GENERATOR; RANDOMIZED ALGORITHM; SAVITCH'S THEOREM;

RANDOM NUMBER GENERATION;

EID: 0030086632     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0004     Document Type: Article

References (21)

1. M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic simulation of logspace, in "Proceedings, 19th Annual ACM Symposium on Theory of Computing, 1987," pp. 132-140.
2. L. Babai, N. Nisan, and M. Szegedy, Multiparty, protocols, pseudorandom generators for logspace, and time-space tradeoffs, J. Comput. System. Sci. 45, No. 2. (1992), 204-232.
3. M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in interactive, proofs, Comput. Complexity 5 (1993), 319-354.
4. c n)-wise independence in NC, J. Assoc. Comput. Mach. 38, No. 4 (1991), 1026-1046.
5. L. Carter and M. Wegman, Universal hash functions, J. Comput. System. Sci. 18, No. 2 (1979), 143-154.
6. B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput. 17, No. 2 (1988), 230-261.
7. B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity 5 (1989), 96-106.
8. A. Cohen and A. Widgerson, Dispersers, deterministic amplicification, and weak random sources, in "Proceedings, 30th Symposium on Foundations of Computer Science, 1989," pp. 14-19.
9. O. Gabber and Z. Galil, Explicit construction of linear-sized superconcentrators, J. Comput. System Sci. 22 (1981), 407-420.
10. R. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, in "Proceedings, 21st Annual ACM Symposium on Theory of computing, 1989," pp. 12-24.
11. R. Impagliazzo and D. Zuckerman, How to recycle random bits, in "Proceedings, 30th Symposium on Foundations of Computer Science, 1989," pp. 248-253.
12. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput. 18 (1989), 1149-1178.
13. M Luby, Removing randomness in parallel computation without a processor penalty, in "Proceedings, 29th Symposium on Foundations of Computer Science, 1988," pp. 162-173.
14. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings, 30th Symposium on Foundations of Computer Science, 1989," pp. 8-13.
15. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica 12, No. 4 (1992), 449-461.
16. N. Nisan, RL ⊆ SC, in "Proceedings, 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 619-623.
17. W. J. Savitch, Relationships between nondeterministic and deterministic space complexities, J. Comput. System. Sci. 4, No. 2 (1970), 177-192.
18. J. P. Schmidt, A. Siegel, and A. Srivivasan, Chernoff-Hoeffding bounds for applications with limited independence, in "Proceedings, 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993," pp. 331-340.
19. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: Explicit construction and applications, in "Proceedings 25th Annual ACM Symposium on Theory of Computing, 1993," pp. 245-251.
20. D. Zuckerman, General weak random sources, in "Proceedings, 31st Symposium on Foundations of Computer Science, 1990," pp. 534-543.
21. D. Zuckerman, Simulating BPP using a general weak random source in "Proceedings, 32nd Symposium on foundations of Computer Science, 1991," pp. 79-89.