Relativized Arthur-Merlin versus Merlin-Arthur games (Q1117218)

Arthur-Merlin games (introduced by L. Babai) give rise to two new complexity classes, AM and MA, depending on who starts the communication. One knows that MA \(\subset AM\). In the present paper the author constructs an oracle C such that \(MA^ C\neq AM^ C\). The proof is modelled upon \textit{Th. P. Baker} and \textit{A. L. Selman} [Theor. Comput. Sci. 8, 177-187 (1977; Zbl 0397.03023)].