COMP 590: Computational Complexity

Course Schedule

This is a tentative schedule of topics and is subject to change. Suggested readings from the textbook are listed for each lecture.

P vs NP

• Jan 7: Intro, Turing Machines, and P
  Reading: chapters 0,1
• Jan 12: P vs NP
  Reading: 2.1
• Jan 14: Reductions and Hardness
  Reading: 2.2
• Jan 19: The Cook-Levin Theorem
  Reading: 2.3
• Jan 21: More Reductions
  Reading: 2.4-5

More Time Complexity

• Jan 26: coNP, EXP, and NEXP
  Reading: 2.6-7
• Jan 28: Diagonalization and Oracles
  Reading: 3.1
• Feb 2: More Oracles and the Limits of Relativizing Techniques
  Reading: 3.4

Space and Other Complexity Classes

• Feb 4: Space Complexity
  Reading: 4.1-2
• Feb 9: The Polynomial Hierarchy
  Reading: 5.1-2, 5.5
• Feb 11: Exam 1
  Covering topics through space complexity
• Feb 16: Low Space Complexity, Communication Complexity
  Reading: 4.3, 13.1, 13.2.1

Circuit Complexity

• Feb 18: Circuit Complexity
  Reading: 6.1-3
• Feb 23: Circuits and P vs NP
  Reading: 6.4-5
• Feb 25: Circuits and Parallel Computing
  Reading: 6.7

Randomized Complexity

• Mar 2: Randomized Algorithms
  Reading: 7.1, 7.2.3
• Mar 4: Randomized Complexity I
  Reading: 7.3-4
• Mar 16: Randomized Complexity II
  Reading: 7.4-5

Interactive Proofs

• Mar 18: Interactive Proofs
  Reading: 8.1, 8.2, 8.5
• Mar 23: Exam 2
  Covering topics through randomized complexity II
• Mar 30: Zero Knowledge Proofs
  Reading: 9.4
• Apr 1: IP=PSPACE
  Reading: 8.3
• Apr 6: Probabilistically Checkable Proofs and Succinct Proofs
  Reading: 11.2.1

Other Topics

• Apr 8: Hardness of Approximation
  Reading: 11.1-3
• Apr 13: Quantum Computing
  Reading: 10.1-3, 10.7
• Apr 15: P vs NP and Cryptography
  Reading: 9.1-2, 18.4
• Apr 20: Student Presentations
  
• Apr 22: Bonus Day
  

Final Exam Period

• Apr 29, 12-3pm: Final Exam
  

Back to course home page