Question: It has been proved that a CNF expression with an arbitrary number of literals can be reduced to the 3SAT form in polynomial time. Show

It has been proved that a CNF expression with an arbitrary number of literals can be reduced to the 3SAT form in polynomial time. Show how the reduction of SAT to 3SAT can be done in polynomial-time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
