Lower bounds for swapping arthur and merlin

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 449-463

  Diehl, Scott ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ERROR ANALYSIS; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; QUADRATIC PROGRAMMING;

BLACK BOX TECHNIQUES;

GAME THEORY;

EID: 38049054895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_33     Document Type: Conference Paper

References (18)

1. Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM 39, 859-868 (1992)
2. Shamir, A.: IP = PSPACE. Journal of the ACM 39, 869-877 (1992)
3. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38, 691-729 (1991)
4. Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th ACM Symposium on the Theory of Computing, pp. 421-429. ACM Press, New York (1985)
5. Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36, 254-276 (1988)
6. Diehl, S., van Melkebeek, D.: Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM Journal on Computing 36(3), 563-594 (2006)
7. Viola, E.: On probabilistic time versus alternating time. Technical Report TR-05-137, Electronic Colloquium on Computational Complexity (2005)
8. Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences 49, 149-167 (1994)
9. Goldreich, O., Zuckerman, D.: Another proof that BPP ⊆ PH (and more). Technical Report TR-97-045, Electronic Colloquium on Computational Complexity (1997)
10. van Melkebeek, D., Pervyshev, K.: A generic time hierarchy for semantic models with one bit of advice. In: Proceedings of the 21st IEEE Conference on Computational Complexity, pp. 129-142. IEEE, Los Alamitos (2006)
11. Santha, M.: Relativized Arthur-Merlin versus Merlin-Arthur games. Information and Computation 80(1), 44-49 (1990)
12. Canetti, R., Even, G., Goldreich, O.: Lower bounds for sampling algorithms for estimating the average. Information Processing Letters 53, 17-25 (1995)
13. Fortnow, L., Lipton, R., van Melkebeek, D., Viglas, A.: Time-space lower bounds for satisfiability. Journal of the ACM 52, 835-865 (2005)
14. Williams, R.: Better time-space lower bounds for SAT and related problems. In: Proceedings of the 20th IEEE Conference on Computational Complexity, pp. 4049. IEEE, Los Alamitos (2005)
15. Segerlind, N., Buss, S., Impagliazzo, R.: A switching lemma for small restrictions and lower bounds for k-DNF resolution. SIAM Journal on Computing 33(5), 1171-1200 (2004)
16. Razborov, A.: Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution. Unpublished manuscript (2002-2003)
17. Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory 17(1), 13-27 (1984)
18. Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5), 865-877 (1991)