Interactive Proofs and Arthur-Merlin Games

Computational complexity is not limited to deterministic algorithms; introducing randomness and interaction opens up entirely new ways to verify computational truth. Understanding how interactive proofs and Arthur-Merlin games work is essential for grasping modern theoretical computer science and cryptographic foundations. This text-only course guides you from foundational complexity concepts to advanced interactive proof systems, helping you develop a strong theoretical intuition for randomized protocols, complexity classes like AM and MA, and the profound implications they have on problems like Graph Isomorphism. What you will learn: Understand the core definitions of interactive proof systems and the role of randomized verification; Analyze Arthur-Merlin complexity classes and the critical distinction between public and private coins; Apply pairwise independent hash functions to estimate set sizes and establish lower bounds; Explore the Graph Non-Isomorphism problem and its containment within the AM class; Examine the Goldwasser-Sipser theorem and its role in equating public and private coin protocols; Investigate the theoretical consequences of Graph Isomorphism being NP-complete, including the collapse of the polynomial hierarchy. The course begins with a clear introduction to basic complexity definitions and randomized algorithms, progressing through the mechanics of interactive protocols, hashing techniques, and key theorems, concluding with written exercises to reinforce your theoretical understanding. This course is designed for students, programmers, and mathematics enthusiasts new to complexity theory, starting with foundational terms and building up step-by-step with no advanced prerequisites required. Start reading today to unlock the power of interactive proofs and randomized computation.