Dynamic Programming 9
0. A problem in NP is NP-complete if
- Option : B
- Explanation : A problem in NP becomes NP – C if all NP problems can be reduced to it in polynomial time. This is same as reducing any of the NPC to it. 3-SAT is an NP-C problem, reducing it to a NP Problem would means that NP Problem is NP – C.
