This preview shows page 1. Sign up to view the full content.
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
 Fall '10
 sanjay
 Algorithms

Click to edit the document details