Plan for Lectures
Lecture Schedule
| Date | Topics | Notes | |
|---|---|---|---|
| Lecture 0 | Sep 4th | Introduction & Course Overview | |
| Lecture 1 | Sep 4th | Languages, Decidability | notes |
| Lecture 2 | Sep 9th | Turing Machines | notes |
| Lecture 3 | Sep 11th | Recursion Theorem | notes |
| Lecture 4 | Sep 13th | Undecidability | notes |
| Lecture 5 | Sep 23rd | Time Complexity | notes |
| Lecture 6 | Sep 25th | P vs NP | Prof. Blais’ notes |
| Lecture 7 | Sep 30th | Polynomial Hierarchy | notes |
| Lecture 8 | Oct 2nd | Boolean Circuits & Formulas | Prof. Blais’ notes |
| Lecture 9 | Oct 7th | Satisfiability & Cook-Levin | notes, Prof. Blais’ notes |
| Lecture 10 | Oct 9th | Non-Uniform Computation | notes, Karp-Lipton-Sipser |
| Lecture 11 | Oct 21st | Randomized Computation & BPP | Prof. Blais’ notes |
| Lecture 12 | Oct 28th | BPP | Prof. Blais’ notes |
| Lecture 13 | Oct 30th | Interactive Proofs | Prof. Blais’ notes |
| Lecture 14 | Nov 4th | Space Complexity | Prof. Blais’ notes |
| Lecture 15 | Nov 6th | Savtich’s Theorem & Logarithmic Space | notes |
| Lecture 16 | Nov 11th | Logarithmic Space | Prof. Blais’ notes |
| Lecture 17 | Nov 13th | NL = coNL | [S13, Chapter 8.6] |
| Lecture 18 | Nov 18th | PSPACE completeness of TQBF | notes |
| Lecture 19 | Nov 20th | Sublogarithmic Space | |
| Lecture 20 | Nov 25th | Non-Regular Languages | |
| Lecture 21 | Nov 27th | TBD | |
| Lecture 22 | Nov 29th | TBD | |
| Lecture 24 | Dec 2nd |
Suggested Reading
| Topics | Suggested Reading | |
|---|---|---|
| Lecture 1 | Languages & Decidability | |
| Lecture 2 | Turing Machines | [S13, Chapter 3] and Lecture notes |
| Lecture 3 | Recursion Theorem | [S13, Chapter 6.1] |
| Lecture 4 | Undecidability | [S13, Chapter 4] |
| Lecture 5 | Time Complexity | [S13, Chapter 7] |
| Lecture 6 | P vs NP | [S13, Chapter 7], [AB09, Chapter 2] |
| Lecture 7 | Polynomial Hierarchy | [S13, Chapter 10.3], [AB09, Chapter 5] |
| Lecture 8 | Boolean Circuits & Formulas | [S13, Chapter 9.3], [AB09, Chapter 6] |
| Lecture 9 | Satisfiability & Cook-Levin | [S13, Chapter 9.3], [AB09, Chapter 2.3] |
| Lecture 10 | Non-Uniform Computation | [S13, Chapter 10.3], [AB09, Chapter 5] |
| Lecture 11 | Randomized Computation & BPP | [S13, Chapter 10.2], [AB09, Chapter 7] |
| Lecture 12 | BPP & other classes | [AB09, Chapter 7] |
| Lecture 13 | Interactive Proofs | [AB09, Chapter 8] |
| Lecture 14 | Space Complexity | [S13, Chapter 8], [AB09, Chapter 4] |
| Lecture 15 | Savtich’s Theorem & Logarithmic Space | [S13, Chapter 8], [AB09, Chapter 4] |
| Lecture 16 | Logarithmic Space | [S13, Chapter 8], [AB09, Chapter 4.3] |
| Lecture 17 | NL = coNL | [S13, Chapter 8.6], [AB09, Chapter 4.3] |
| Lecture 18 | PSPACE completeness of TQBF | [S13, Chapter 8.3], [AB09, Chapter 4.2] |
| Lecture 19 | Sublogarithmic Space | |
| Lecture 20 | ||
| Lecture 21 |