The Cook-Levin Theorem

1
The Cook-Levin Theorem

• Zeph Grunschlag

2
Announcements

• Last HW due Thursday
• Please give feedback about course at
  oracle.seas.columbia.edu/wces

3
Agenda

• Proof from definition that CSAT is NP-complete
  (Cook-Levin Theorem)
• CSAT ?P 3SAT so 3SAT is NP-complete

4
Notation for NTM Branching

• We need a way of dealing with all the possible
  choices that a non-deterministic TM can take at
  any point of the computation. Every NTM has a
  finite maximum on the number of choices possible,
  called the branching factor and denoted by b.
• Q What is b for the following?

ab?R