| January 17 | Introduction, Problems and
Algorithms Reading: ch. 1 |
| January 24 | Turing Machines Reading: ch. 2 |
| January 31 | Turing Machines, cont'd Homework 1 due |
| February 7 | Computability Reading: ch. 3 |
| February 14 | Cancelled due to snow. |
| February 21 | Computability, cont'd; Boolean Logic Reading: ch. 4 |
| February 28 | Boolean Logic, cont'd Homework 2 due |
| March 7 | Midterm exam |
| March 14 | Spring Break - No Class |
| March 21 | Relations between Complexity Classes Reading: ch. 7 |
| March 28 | Reductions and Completeness Reading: ch. 8 |
| April 4 | NP-Completeness, cont'd Reading: ch. 9 Homework 3 due |
| April 11 | NP-Completeness, cont'd Reading: G&J ch. 1-3 |
| April 18 | NP-Completeness, cont'd Reading: G&J ch. 4-6, browse Appendix Homework 4 due |
| April 25 | Final Exam |
| Last updated 4/23/07 by rwright (at) cs.stevens.edu | Copyright © 2007 Rebecca N. Wright |