Question: Consider the following algorithm for checking satisfiability: Put the formula into disjunctive normal form and then check to see if all of the disjuncts

Consider the following algorithm for checking satisfiability: Put the formula into disjunctive normal form and then check to see if all of the disjuncts are contradictions (containing both a variable and its complement). If not, then it is satisfiable. Why is this algorithm exponentially costly?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
