Question: 3. What is wrong with the following proof that P NP? (2 marks) An algorithm for 3SAT that tries every possible truth assignment to see

3. What is wrong with the following "proof that P NP? (2 marks) An algorithm for 3SAT that tries every possible truth assignment to see if any of them makes all clauses true takes 12(2n) time, where n is the number of input Boolean variables. Therefore, 3SAT & P. Since 3SAT E NP, it follows that PE NP
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
