Arthur-Merlin games were introduced recently by Babai in order to capture the intuitive notion of efficient, probabilistic proof-systems. Considered as complexity classes, they are extensions of NP. It turned out, that one exchange of messages between the two players is sufficient to simulate a constant number of interactions. Thus at most two new complexity classes survive at the constant levels of this new hierarchy: AM and MA, depending on who starts the communication. It is known that \(MA \subseteq AM\). In this paper we answer an open problem of Babai: we construct an oracle C such that \(AM^C - \Sigma _2^{P,C} \ne \emptyset\). Since \(MA^C \subseteq \Sigma _2^{P,C}\), it follows that for some oracle C, MAC≠AMC. Our prooftechnique is a modification of the technique used by Baker and Selman to show that ∑ 2 P and ∏ 2 P can be separated by some oracle. This result can be interpreted as an evidence that with one exchange of messages, the proof-system is stronger when Arthur starts the communication.
[1]
Shafi Goldwasser,et al.
On the Power of Interaction
,
1986,
FOCS.
[2]
Stathis Zachos,et al.
Does co-NP Have Short Interactive Proofs?
,
1987,
Inf. Process. Lett..
[3]
Stathis Zachos,et al.
Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview
,
1986,
SCT.
[4]
Shafi Goldwasser,et al.
Private coins versus public coins in interactive proof systems
,
1986,
STOC '86.
[5]
Theodore P. Baker,et al.
A second step toward the polynomial hierarchy
,
1976,
17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[6]
Silvio Micali,et al.
The Knowledge Complexity of Interactive Proof Systems
,
1989,
SIAM J. Comput..
[7]
László Babai,et al.
Trading group theory for randomness
,
1985,
STOC '85.