CSC 320: Notes on NP-Completeness.

1. A shortened version of the pertinent facts
2. Does P=NP?
3. Understanding Time Complexity
4. SAT, the First NP-complete Problem
5. History of NP-completeness Reductions
6. SAT reduces to 3-SAT

Return to Home page for CSC 320.