Documents 1 How to establish NP-hardness Lemma: If L 1 is NP-hard and L 1 ≤ L 2 then L 2 is NP-hard.

1 How to establish NP-hardness Lemma: If L1 is NP-hard and L1 ≤ L2 then L2 is NP-hard. 2 SAT SAT is in NP. Cook’s theorem (1972): SAT is NP-hard. 3 SAT SAT: Given a Boolean…

Documents How to establish NP -hardness

Slide 1 1 How to establish NP-hardness Lemma: If L1 is NP-hard and L1 ≤ L2 then L2 is NP-hard. 2 SAT SAT is in NP. Cook’s theorem (1972): SAT is NP-hard. 3 SAT SAT: Given…

Documents SAT

1 SAT SAT: Given a Boolean function in CNF representation, is there a way to assign truth values to the variables so that the function evaluates to true? SAT: Given a CNF,…

Documents How to establish NP -hardness

1 How to establish NP-hardness Lemma: If L1 is NP-hard and L1 ≤ L2 then L2 is NP-hard. 2 SAT SAT is in NP. Cook’s theorem (1972): SAT is NP-hard. 3 SAT SAT: Given a Boolean…