CS172 Notes

Spring 2015

I’ll put my notes for CS172 here. If you see an error or would like to contribute an improvement please fork the repo and send a pull request.

  1. 20 January: Course info
  2. 22 January: DFAs
  3. 27 January: NFAs
  4. 29 January: Regular Expressions
  5. 03 February: Irregular Languages
  6. 05 February: Minimal DFAs
  7. 10 February: Streaming Algorithms
  8. 12 February: Turing Machines
  9. 17 February: Enumerators and NDTMs
  10. 19 February: Undecidable and Unrecognizable Languages
  11. 24 February: Examples of Undecidable and Unrecognizable Languages
  12. 03 March: Reductions, Rice’s Theorem, and Gödel’s First Incompleteness Theorem
  13. 05 March: Gödel’s Incompleteness Theorems
  14. 10 March: Kolmogorov Complexity
  15. 12 March: Intro to Complexity Classes
  16. 17 March: Boolean Circuits and Satisfiability
  17. 19 March: SAT and 3SAT
  18. 31 March: NP-Complete Problems I: Independent Set, Clique, Vertex Cover, Subset Sum, and Partition
  19. 02 April: NP-Complete Problems II: Bin Packing, Scheduling, Knapsack, and Steiner Tree
  20. 07 April: Space Complexity
  21. 14 April: NL = coNL
  22. 16 April: PSPACE and Hierarchy Theorems
  23. 21 April: Zero-knowledge Proofs
  24. 23 April: More on Zero Knowledge, Interactive Proofs, and an ID Scheme
  25. 28 April: Complexity of Approximation Algorithms I
  26. 01 May: Complexity of Approximation Algorithms II
  27. 05 May: Complexity of Approximation Algorithms III: Steiner Tree