Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Schedule

This schedule is tentative and subject to change. Any changes will be announced.

Lecture Number (Date)TopicsAnnouncementsAdditional Resources
Lecture 1 (Jan 14)
  • Syllabus
  • Review: Math Notation and Big-Oh Notation
  • Languages
  • Introduction to Turing Machines
Lecture 2 (Jan 16)
  • Turing Machines and equivalent computational models
  • Uncomputability
  • Universal Turing Machines
Correction from in-class lecture; see Lecture 2.
Lecture 3 (Jan 21)
  • Uncomputability wrap-up
  • Complexity Classes , , and
Homework 1 assigned.
Lecture 4 (Jan 23)
  • Reducibility
  • -Completeness
  • Cook-Levin Theorem
Lecture 5 (Jan 28)
  • Cook-Levin Theorem wrap-up
  • -Reductions
Lecture 6 (Jan 30)
  • More -Reductions
  • Search vs. Decision Problems
  • Complexity Classes and
Problem 5 of Homework 1 will be changed to reflect change in schedule.
Lecture 7 (Feb 4)
  • Diagonalization: Time Hierarchies
Lecture 8 (Feb 6)
  • Diagonalization: -intermediate Problems
  • Diagonalization: Oracle Machines
Homework 1 due.
Lecture 9 (Feb 11)
  • Space Complexity: , , and
Lecture 10 (Feb 13)
  • Space Complexity (Continued)
Homework 2 assigned.
Lecture 11 (Feb 18)
  • Space Complexity Wrap-up
  • The Polynomial Hierarchy
Lecture 12 (Feb 20)
  • The Polynomial Hierarchy (continued)
  • Alternations
Lecture 13 (Feb 25)
  • The Polynomial Hierarchy and Alternations (continued)
Lecture 14 (Feb 27)
  • Randomized Computations
Homework 2 due.
Midterm Review (Mar 4)Covers Lectures 1-13 (Up to and Alternation)Homework 3 assigned.
Midterm Exam (Mar 6)Covers Lectures 1-13
Lecture 15 (Mar 11)
  • Midterm Answers
  • Randomized Computations (continued)
Final Project information posted.
Lecture 16 (Mar 13)
  • Randomized Computations (continued)
  • Boolean Circuits
Lecture 17 (Mar 18)
  • Boolean Circuits (continued)
Lecture 18 (Mar 20)
  • Boolean Circuits (continued)
Homework 3 due.
Mar 22, 11:59pm CDTFinal Project proposals due.
NO CLASS; SPRING BREAK (Mar 25)
NO CLASS; SPRING BREAK (Mar 27)
Lecture 19 (Apr 1)
  • Interactive Proofs
Homework 4 assigned.
Lecture 20 (Apr 3)
  • Interactive Proofs (continued)
Lecture 21 (Apr 8)
  • Interactive Proofs (continued)
Lecture 22 (Apr 10)
  • Interactive Proofs (continued)
NO CLASS; Recorded Lecture (Apr 15)
  • Cryptography and Complexity Theory
Homework 4 due.
NO CLASS; Recorded Lecture (Apr 17)
  • Cryptography and Complexity Theory (continued)
Lecture 23 (Apr 22)
  • The PCP Theorem
Homework 5 assigned.
Lecture 24 (Apr 24)
  • The PCP Theorem (continued)
Final Project Presentations (Apr 29)
Final Project Presentations (May 1)
May 6, 2:00pm CDTHomework 5 due.
May 10, 11:59pm CDTFinal Project written reports due.