CS 6520 - Computational Complexity Fall 2015
Wednesday, September 30, 2015
Lecture 19
Lautemann's proof
that BPP is in Σ
p
2
∩Π
p
2
.
Informal notion of
Merlin-Arthur games
and example of proof of graph non-isomorphism.
Newer Post
Older Post
Home