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?

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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!