Open In App
Related Articles

GATE | GATE CS 2012 | Question 4

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads