Symmetric alternation captures BPP

Computational Complexity

Volumn 7, Issue 2, 1998, Pages 152-162

  Russell, Alexander ^a,b   Sundaram, Ravi ^c,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Delta Global Trading LP   (United States)

Author keywords

Alternation; Complexity classes; Randomness; Symmetric quantifiers

Indexed keywords

EID: 0032356378     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050007     Document Type: Article

References (12)

1. MIKLÓS AJTAI, JÁNOS KOMLÓS, AND E. SZEMERÉDI, Deterministic simulation in LOGSPACE. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, 1987, 132-140.
2. THEODORE P. BAKER AND ALAN L. SELMAN, A second step toward the polynomial hierarchy. Theoretical Computer Science 8 (1979), 177-187.
3. R. CANETTI, More on BPP and the polynomial-time hierarchy. Information Processing Letters 57(5) (1996).
4. U. FEIGE, A. SHAMIR, AND M. TENNENHOLTZ, The noisy oracle problem. In Proc. CPRYPTO 1988, 1988, 284-296.
5. J. FEIGENBAUM, D. KOLLER AND P. SHOR, A game-theoretic characterization of interactive complexity classes (extended abstract). In Proc. Structures '95, Minneapolis, 1995, IEEE, 227-237.
6. JOHN E. HOPCROFT AND JEFFREY D. ULLMAN, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, Reading, Massachusetts, 1979.
7. RUSSELL IMPAGLIAZZO, LEONID A. LEVIN, AND MICHAEL LUBY, Pseudo-random generation from one-way functions (extended abstract). In Proceedings of the Twenty-first Annual ACM Symposium on the Theory of Computing, 1989, 12-24.
8. C. LAUTEMANN, BPP and the polynomial hierarchy. Information Processing Letters 17 (1983), 215-217.
9. NOAM NISAN AND DAVID ZUCKERMAN, More deterministic simulation in logspace. In Proceeding's of the Twenty-fifth Annual ACM Symposium on the Theory of Computing, 1993, 235-244.
10. MICHAEL SIPSER, A complexity theoretic approach to randomness. In Proceedings of the Fifteenth Annual ACM Symposium on the Theory of Computing, 1983, 330-335.
11. L. J. STOCKMEYER, The polynomial time hierarchy. Theoretical Computer Science 3 (1976), 1-22.
12. ANDREW C. YAO, Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, 80-91.