GATE | GATE-CS-2009 | Question 13

Let pA be a problem that belongs to the class NP. Then which one of the following is TRUE?
(A) There is no polynomial time algorithm for pA
(B) If pA can be solved deterministically in polynomial time,then P = NP
(C) If pA is NP-hard, then it is NP-complete.
(D) pA may be undecidable.


Answer: (C)

Explanation:

If a problem is both NP hard and NP, then it is NP Complete.  See https://www.geeksforgeeks.org/np-completeness-set-1/ for details.


Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.