More deterministic simulation in logspace

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 235-244

  Nisan, Noam ^a   Zuckerman, David ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC SIMULATION; LOGSPACE; RANDOM BITS; RANDOM SOURCES; TECHNICAL TOOLS;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

ALGORITHMS; COMPUTATION THEORY; ERROR ANALYSIS; MATHEMATICAL MODELS; RANDOM NUMBER GENERATION; RANDOM PROCESSES; SET THEORY; STATE SPACE METHODS; THEOREM PROVING;

COMPLEXITY THEORY; LOGSPACE; RANDOMIZED SPACE(S) ALGORITHM; SAVITCH'S THEOREM;

EID: 0027208504     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167162     Document Type: Conference Paper

References (19)

1. [AKS87] M. Ajtai, J. Komlos, and E. Szemeredi, "Deterministic Simulation of Logspace, " 19th STOC, 1987, pp. 132-140.
2. [BNS90] L. Babai, N. Nisan, and M. Szegedy. Multiparty Protocols and Logspace-hard pseu-dorandom sequences. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
3. [BGG90] M. Bellare, O. Goldreich, and S. Goldwasser, "Randomness in Interactive Proofs, " 31st FOCS, 1990, pp. 563-572.
4. [BR91] B. Berger and J. Rompel, "Simulating (logc n)-Wise Independence in NC, " JACM, 38(4):1026-1046, 1991.
5. [CW79] L. Carter and M. Wegman, "Universal Hash Functions, " J. Comp. and Syst. Sci., 18(2): 143-154, 1979.
6. [CG88] B. Chor and O. Goldreich, "Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity, " SI AM J. Compute 17(2):230-261, 1988.
7. [CG89] B. Chor and O. Goldreich, "On the Power of Two-Point Based Sampling, " Journal of Complexity, 5:96-106, 1989.
8. [CW89] A. Cohen and A. Wigderson, "Dispersers, Deterministic Amplification, and Weak Random Sources, " 30th FOCS, 1989, pp. 14-19.
9. [ILL89] R. Impagliazzo, L. Levin, and M. Luby, "Pseudo-Random Generation from One-Way Functions, " 21st STOC, 1989, pp. 1224.
10. [IZ89] R. Impagliazzo and D. Zuckerman, "How to Recycle Random Bits, " 30th FOCS, 1989, pp. 248-253.
11. [Lub88] M. Luby, "Removing Randomness in Parallel Computation Without a Processor Penalty, " 29th FOCS, 1988.
12. [MNN89] R. Motwani, J. Naor, and M. Naor, "The Probabilistic Method Yields Deterministic Parallel Algorithms, " 30th FOCS, 1989, pp. 8-13.
13. [Nis90] N. Nisan. Pseudorandom generators for space-bounded computation. In Proceedings of the 22st Annual ACM Symposium on Theory of Computing, 1990.
14. [Nis92] N. Nisan. RL C SC. 24th STOC, 1992, pp. 619-623.
15. [Sav70] W.J. Savitch. Relationships between non- deterministic and deterministic space com-plexities. J. Comp. and Syst. Sci., 4(2):177- 192, 1970.
16. [SSS93] J.P. Schmidt, A. Siegel, A. Srinivasan, "Chernoff-Hoeffding Bounds for Applica-Tions with Limited Independence, " to appear in 4th SODA, 1993.
17. [WZ93] A. Wigderson and D. Zuckerman, "Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications, " 25th STOC, 1993, to appear.
18. [Zuc90] D. Zuckerman, "General Weak Random Sources, " 31st FOCS, 1990, pp. 534-543.
19. [Zuc91] D. Zuckerman, "Simulating BPP Using a General Weak Random Source, " 32nd FOCS, 1991, pp. 79-89.