CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 8

Last update September 23, 2003

Topics References

1. Background for NP-completeness

2. Decision Problems

3. Graph Color Problem

4. Decision Problem and Optimization Problem

5. Intuition on Class NP (using graph color)

6. Decision Problems as Language Recognition Problems Problem Solving as Language Recognition

7. Certificate and Its Verification Textbook p.980

8. Formal Definition of Class NP Textbook p.981

Examples to be given in the next lecture

Back to Lectures Home Page

Back to CS600 Home Page

Back to Toida's Home Page

Topics	References

1. Background for NP-completeness
2. Decision Problems
3. Graph Color Problem
4. Decision Problem and Optimization Problem
5. Intuition on Class NP (using graph color)
6. Decision Problems as Language Recognition Problems	Problem Solving as Language Recognition
7. Certificate and Its Verification	Textbook p.980
8. Formal Definition of Class NP	Textbook p.981
Examples to be given in the next lecture