I am trying to understand different interactive proof systems, in particular AM and MA.
Is there a typical problem for the complexity class MA as Graph-NonIsomorphism problem is for AM?
Is there a problem in MA that is not known to be in NP or BPP?
It seems to me that MA is a more natural proof system than AM. Is there a reason that most books discuss AM in detail while merely glossing over MA?
