14: NP-Completeness

Coming soon.

Topics

• P, NP, and NP-complete
• Polynomial-time reductions
• Cook-Levin theorem (SAT is NP-complete)
• Common NP-complete problems (3-SAT, Clique, Vertex Cover, Hamiltonian Path)
• Proving NP-completeness via reduction
• Self-reducibility