Unformatted text preview: color : V → { 1 , 2 , 3 } such that for all ( v, w ) ∈ E , color ( v ) 6 = color ( w )? Show that the above problem is NPcomplete. 4. NotAllEqual SAT (NAESAT). Input: A set of variables V , and a set C of clauses (you may assume each clause has exactly three literals). Question: Is there a truth assignment to the variables so that each clause has at least one true literal and at least one false literal? Show that the above problem is NP complete. 1...
View
Full
Document
This note was uploaded on 01/06/2012 for the course CS 3230 taught by Professor Sanjay during the Fall '10 term at National University of Singapore.
 Fall '10
 sanjay
 Algorithms

Click to edit the document details