How many conditions have to be met if an NP- complete problem is polynomially reducible?
|Answer» B. 2|
|Explanation: 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.|
Login to Continue
It will take less than 2 minutes