Chapter 8: NP Completeness — Design and Analysis of Algorithms (CSC325) Notes

P, NP, NP-Hard, NP-Complete, Cook's Theorem, proofs of NP-Completeness (CNF-SAT, Vertex Cover, Subset Sum), and approximation algorithms.

Core Course
Ch. 8: NP Completeness

Notes Arriving Soon

Handwritten chapter notes for this subject are currently being digitized. Help your fellow students by contributing your notes!

Ch. 7: Number Theoretic Algorithms

Topics & Key Objectives in Chapter 8

NPNP-HardNP-CompleteCook's Theoremproofs of NP-Completeness (CNF-SATVertex CoverSubset Sum)and approximation algorithms.

Related Study Resources for Design and Analysis of Algorithms (CSC325)

Subject HubDesign and Analysis of Algorithms (CSC325)Official CurriculumDesign and Analysis of Algorithms SyllabusTU Board PapersDesign and Analysis of Algorithms Past QuestionsSemester Directory5th Sem Subjects