Unformatted text preview: CNF 2 is in P . b. Show that CNF 3 is NPcomplete. Problem 8.3. (10 points) You can do this problem after we talk about NPcompleteness on Monday. Let DBLSAT = {h φ i  φ has at least two satisfying assignments } . Show that DBLSAT is NPcomplete. A subset of the nodes of a graph G is a dominating set if every other node of G is adjacent to some node in the subset. Let DOMSET = {h G , k i  G has a dominating set with k nodes } Show that DOMSET is NPcomplete. For hardness, reduce from VERTEXCOVER ....
View
Full Document
 Winter '08
 Rupak
 Computational complexity theory, NPcomplete, Karp's 21 NPcomplete problems, satisﬁable CNF formula

Click to edit the document details