CS 6814

CS 6814

Course information provided by the Courses of Study 2024-2025.

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.

When Offered Fall.

Outcomes
  • Describe the types of probabilistic proof system and their application in different areas of theoretical computer science.
  • Rigorously prove core properties of proof systems.
  • Design proof systems suitable for specific problems.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 19714 CS 6814   LEC 001

  • Instruction Mode: In Person
    For Bowers CIS Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/