This page summarizes the lectures and mentions the suggested reading assignments. This summary is quite brief, and its intention is to help the student and instructor recollect what was covered.

Week 1

Week 2

Week 3

Meeting 1: Looked at the example of Gaussian Elimination to point out that unlike the analysis of algorithms in an algorithms course, the Turing machine will have to explicitly do the bit operations on numbers. Ruuning time needs to account for this. We introduced the class NP from Chapter 2, and discussed why the languages composites, subset sum, and independent set are in NP. For other examples, see Section 2.1 of the text.

Week 4

Week 5

Week 6

Week 7

Week 8

Week 9

Week 10

Week 11

Week 12

Week 13

Week 14

Week 15