On Higher Arthur-Merlin Classes

We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP,R and coR. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.

[1]  Vikraman Arvind,et al.  On pseudorandomness and resource-bounded measure , 2001, Theor. Comput. Sci..

[2]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[3]  Osamu Watanabe,et al.  Polynomial Time 1-Turing Reductions from #PH to #P , 1992, Theor. Comput. Sci..

[4]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[5]  Stathis Zachos,et al.  A Decisive Characterization of BPP , 1986, Inf. Control..

[6]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[7]  Manindra Agrawal,et al.  The Boolean isomorphism problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8]  Vikraman Arvind,et al.  Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results , 2000, STACS.

[9]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[10]  V. Arvind,et al.  On Resource-Bounded Measure and Pseudorandomness , 1997, FSTTCS.

[11]  Jin-Yi Cai.  S/sub 2/ ZPP/sup NP/ , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[13]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[14]  Heribert Vollmer,et al.  The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..

[15]  José L. Balcázar,et al.  Structural complexity 2 , 1990 .

[16]  Sampath Kannan,et al.  Oracles and queries that are sufficient for exact learning (extended abstract) , 1994, COLT '94.

[17]  Sampath Kannan,et al.  Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..

[18]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[19]  Stathis Zachos,et al.  Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.

[20]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[21]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[22]  Osamu Watanabe,et al.  New Collapse Consequences of NP Having Small Circuits , 1995, ICALP.