Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Algorithms | NP Complete | Question 1

  • Last Updated : 28 Jun, 2021

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.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!