6.045: Automata, Computability, and Complexity (GITCS) Class 16 Nancy Lynch Today: More NP-Completeness • Topics: – 3SAT is NP-complete – Clique and VertexCover are…
