Let’s do some NP-completeness proofs
Suppose somebody else has already shown that the following problems are NP-complete
3SAT
Hamiltonian Cycle
Vertex Cover
Previous slide
Next slide
Back to first slide
View graphic version