06-NP完全问题.ppt

* Example φ = (x1 ∨ ?x2 ∨ ?x3) ∧ (?x1 ∨ x2 ∨ x3) ∧ (x1 ∨ x2 ∨ x3), * Proof. Con. We must show that this transformation of φ into G is a reduction First, suppose that φ has a satisfying assignment. Then each clause Cr contains at least one literal rj that is assigned 1. and each such literal corresponds to a vertex vrj. Picking one such true literal from each clause yields a set V of k vertices. We claim that V is a clique. For any two vertices vri, vsj where r ≠ s, both corresponding literals ri rand sj are mapped to 1 by the given satisfying assignment, and thus the literals cannot be com