This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 06/03/2008 for the course CS 181 taught by Professor Rupak during the Winter '08 term at UCLA.
 Winter '08
 Rupak

Click to edit the document details