Question: Consider the problem DNF-DISSAT, which takes a Boolean formula S in disjunctive normal form (DNF) as input and asks whether S is dissatisfiable, that is,
Consider the problem DNF-DISSAT, which takes a Boolean formula S in disjunctive normal form (DNF) as input and asks whether S is dissatisfiable, that is, there is an assignment of Boolean values to the variables of S so that it evaluates to 0. Show that DNF-DISSAT is NP-complete.
Step by Step Solution
3.45 Rating (177 Votes )
There are 3 Steps involved in it
1 Produce the complete truthtable for the given DNF For if ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
2036_61d6ac34265b6_835500.pdf
180 KBs PDF File
2036_61d6ac34265b6_835500.docx
120 KBs Word File
