|
|
|
|
1. Satisfiability for various types of logic
|
|
|
2. Background for NP-completeness
|
|
|
3. Decision Problems
|
|
|
4. Graph Color Problem
|
|
|
5. Decision Problem and Optimization Problem
|
|
|
6. Intuition on Class NP (using Hamilton cycle)
|
|
|
7. Decision Problems as Language Recognition Problems
|
Problem Solving as Language Recognition
|
|
8. Certificate and Its Verification
|
Textbook p.980
|
|
9. Formal Definition of Class NP
|
Textbook p.981
|
|
|
|
|
10. Examples of NP Problems with Certificate and Verification
|
|
|
Graph Coloring, Existence of Cycle that Visits All Vertices Once
|
|
|
11. Roadblock problem is not in NP.
|
|
|
12. NP-Complete Problems
|
Textbook pp. 984 - 986
|