Question: Exercise 1 0 . 3 . 4 : Give a polynomial - time algorithm to solve the problem 2 SAT, i . e . ,
Exercise : Give a polynomialtime algorithm to solve the problem
SAT, ie satisfiability for CNF boolean expressions with only two literals
per clause. Hint: If one of two literals in a clause is false, the other is for ced to
be true. Start with an assumption about the truth of one variable, and chase
down all the consequences for other variables.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
