MODULE 8
P vs NP
P vs NP, Part 1
P vs NP, Part 2
Quick Review
Clique Reduces to Independent Set
An Exercise With Reductions
3SAT Reduces to Clique
Demystifying Cook-Levin Theorem
Algorithms for Hard Problems
Polynomial-Time Reductions
Non-Deterministic Polynomial Time
Approximation Algorithms
MODULE 8:   P vs NP
P vs NP, Part 2
1 Quick Review

2 Clique Reduces to Independent Set

3 An Exercise With Reductions

4 3SAT Reduces to Clique

5 Demystifying Cook-Levin Theorem