Open In App

Algorithms | NP Complete | Question 1

Assuming P != NP, which of the following is true ? 
(A) NP-complete = NP

(B) NP-complete P = 

(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.

Hence (B) is the correct answer.


Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :