Skip to content
Related Articles

Related Articles

GATE | GATE CS 2012 | Question 4
  • Last Updated : 29 Nov, 2013
GeeksforGeeks - Summer Carnival Banner
Assuming P != NP, which of the following is true ?
(A) NP-complete = NP
(B) NP-complete \cap P = \Phi
(C) NP-hard = NP
(D) P = NP-complete

(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation:

The answer is B (no NP-Complete problem can be solved in polynomial time). Because, if one NP-Complete problem can be solved in polynomial time, then all NP problems can solved in polynomial time. If that is the case, then NP and P set become same which contradicts the given condition.

Related Article:
NP-Completeness | Set 1 (Introduction)
P versus NP problem (Wikipedia)

Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :