COMS W3261
Computer Science Theory
Lecture 18: November 26, 2012
Satisfiability

Outline

1. Review

2. SAT is NP-complete: the Cook-Levin theorem

3. Some Other NP-complete Problems

4. Complements of Languages in NP

5. Practice Problems

  1. Show that 1SAT and 2SAT are solvable in linear time.
  2. Show that 3SAT is NP-complete.
  3. Show that CSAT is NP-complete.

6. Reading Assignment



aho@cs.columbia.edu