A

Admin • 832.70K Points
Coach

Q. How many conditions have to be met if an NP- complete problem is polynomially reducible?

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

Explanation by: Admin

a function t that maps all yes instances of decision problems d1 and d2 and t should be computed in polynomial time are the two conditions.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.