Question: (a) If P = NP, then all problems in NP can be solved in polynomial time deterministically. (b) It is known that Satisfiability is NP-complete.
(a) If P = NP, then all problems in NP can be solved in polynomial time deterministically.
(b) It is known that Satisfiability is NP-complete.
Assume that an O(n724) deterministic algorithm has been found for the Satisfiability problem, then P = NP.
(c) If a decision problem A is NP-complete, proving that A is reducible to B,
in polynomial time, is sufficient to show that B is NP-complete.
Answer true or false WITH explaination.
Step by Step Solution
3.26 Rating (152 Votes )
There are 3 Steps involved in it
aFALSE Given a polynomial time algorithm for solving some NPcomplete problem you can solve any NP pr... View full answer
Get step-by-step solutions from verified subject matter experts
