A

Admin • 832.70K Points
Coach

Q. How many steps are required to prove that a decision problem is NP complete?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 4

Explanation by: Admin

first, the problem should be np. next, it should be proved that every problem in np is reducible to the problem in question in polynomial time.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.