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