CS 6520 - Computational Complexity Fall 2015
Friday, October 2, 2015
Lecture 20
Definitions of MA and AM
NP
BPP
in MA in AM in NP
BPP
NP in BPP implies PH in BPP
MA in Π
P
2
AM in Σ
P
2
AM and MA with perfect completeness (no error if x in L)
Some details in Section 2 of
Katz Notes
Newer Post
Older Post
Home