Question: 12. 3-SAT: INPUT: A Boolean Expression E( , ,Fn) in Clause form with at most 3 literals per clause. QUESTION: Does E evaluate to TRUE

12. 3-SAT: INPUT: A Boolean Expression E( , ,Fn) in Clause form with at most 3 literals per clause. QUESTION: Does E evaluate to TRUE for some assignment of TRUE and FALSE to the variables, the r's? Show that if SAT is N'P-complete, then 3-SAT is N'P-complete
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
