Dynamic Programming 9
- 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.
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.