Question: No code please. Just explain. Thank you! answer can also be: this is not known (open problem) 1. Say that a problem pe NPC and

No code please. Just explain. Thank you!
answer can also be: this is not known (open problem) 1. Say that a problem pe NPC and there is a polynomial reduction from Q to a problem R, then R NPC. 2. Every Co -NPC problem is decidable 3. If we know that a problem Q NPC, then P. 4. Say that in the Subset Sum problem all numbers are smaller than n7. Then the Subset Sum problem becomes polynomial
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
