15-453 Formal Languages, Automata, and Computation
Lecture 33: NP-Completeness

We prove the NP-completeness of SAT and 3SAT. This gives us a means to show that some problems are hard, that is, under the assumption that P is different from NP they will lie outside of P. This is accomplished by a reduction from a problem already known to be NP-complete.

• Reading: Ch. 7.4, pp. 253-260
• Previous lecture: Polynomial Time Reductions
• Next lecture: The Importance of SAT

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning