CS 6814 - Probabilistic Proofs

Fall. 3 credits. Student option grading.

N. Spooner.

This course offers a graduate-level introduction to the theory of probabilistic proof systems. The area has deep connections to many aspects of theoretical computer science, including complexity theory and hardness of approximation, coding theory, cryptography and quantum computing. Topics covered will include the PCP theorem, interactive proofs, zero knowledge, succinct arguments, and quantum proof systems.

Outcome 1: Describe the types of probabilistic proof system and their application in different areas of theoretical computer science.

Outcome 2: Rigorously prove core properties of proof systems.

Outcome 3: Design proof systems suitable for specific problems.