More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU

This graduate computational complexity lecture studies constant-round interactive proofs, Merlin–Arthur classes, public versus private coins, error reduction, and applications to complexity classes and graph isomorphism.

Syllabus

Introduction
MA and AM
BPPV
Last time
Characterization of AM
Interactive proofs
Merlin Arthur proofs
Private coins
Efficient error reduction
Parallel repetition
Polynomials
Arthurs Coins
Arthurs Message
Arthurs Final Message
Marthas Final Message
MA AM
MA L
Arthur
Merlin
Fishin
Sketch
Fare reduction
Amplification
AMA
Any questions
Translation
Compression