| Topics | References |
| 1. Polynomial Time Transformation (Reduction) | Textbook pp. 984 - 985 |
| 2. Definition of NP-Completeness | Textbook pp. 984 - 986 |
| 3. Examples of NP-Complete Problems | Textbook 34.5 |
| CNF SAT, Graph Coloring, Committee Meeting Scheduling, | |
| Vertex Cover, Set Cover, Clique | |
| 4. A Tree of Reduction for NP-Complete Problems | |
| 5. Proof of NP-Completeness | Textbook 34.4 |
| Bin Packing |