More on BPP and the polynomial-time hierarchy

Information Processing Letters

Volumn 57, Issue 5, 1996, Pages 237-241

  Canetti, Ran ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Interactive proofs; Randomness; Theory of computation

Indexed keywords

EID: 0000560640     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00016-6     Document Type: Article

References (11)

1. N. Alon and J. Spencer, The Probabilistic Method (Wiley, New York, 1992).
2. L. Babai and S. Moran, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci. 36 (1988) 254-276.
3. M. Furer, O. Goldreich, Y. Mansour, M. Sipser and S. Zachos, On completeness and soundness in interactive proof systems, Adv. Comput. Res. 5 (1989) 429-442.
4. S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive proofs, SIAM J. Comput. 18 (1989) 186-208.
5. S. Goldwasser and M. Sipser, Private coins versus public coins in interactive proof systems. Adv. Comput. Res. 5 (1989) 73-90.
6. C. Lautemann, BPP and the Polynomial Hierarchy, Inform. Process. Lett. 17 (1983) 215-217.
7. A. Russell and R. Sundaram, Symmetric alternation captures BPP, Tech. Rept. MIT-LCS-TM-541, 1995.
8. M. Sipser, A complexity theoretic approach to randomness, in: Proc. 15th STOC (1983) 330-335.
9. L.J. Stockmeyer, The polynomial Time Hierarchy, Theoret. Comput. Sci. 3 (1976) 1-22.
10. A. Shamir, IP = PSPACE, in: Proc. 31st FOCS (1990) 11-15.
11. C. Wrathall, Complete sets and the polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1976) 23-33.