Unformatted text preview: φ has exactly one True literal. Show that Exactly-one 3SAT is NP-complete. Problem 4 In the MAX CUT problem, we are given an undirected graph G , an integer K and have to decide where there is a subset of vertices S such that there are at least K edges that have one endpoint in S and one endpoint in S . Prove that this problem is NP-complete by giving a reduction from the following variant of 3SAT which is known to be NP-complete: In the Not-All-Equal SAT problem, we are given a 3CNF formula φ and need to decide if there exists a satisfying assignment such that every clause of φ has one or two True literals....
View Full Document
- Fall '07
- Computer Science, satisfying assignment, Computation Review Session