Let X 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 X.

**(B)** If X can be solved deterministically in polynomial time, then P = NP.

**(C)** If X is NP-hard, then it is NP-complete.

**(D)** X may be undecidable.

**Answer:** **(C)** **Explanation:** (A) is incorrect because set NP includes both P(Polynomial time solvable) and NP-Complete .

(B) is incorrect because X may belong to P (same reason as (A))

(C) is correct because NP-Complete set is intersection of NP and NP-Hard sets.

(D) is incorrect because all NP problems are decidable in finite set of operations.

Quiz of this Question

## Recommended Posts:

- Algorithms | NP Complete | Question 1
- Algorithms | NP Complete | Question 2
- Algorithms | NP Complete | Question 4
- Algorithms | NP Complete | Question 5
- Algorithms | NP Complete | Question 6
- Proof that Hamiltonian Path is NP-Complete
- Proof that vertex cover is NP complete
- Difference between NP hard and NP complete problem
- Proof that Hamiltonian Cycle is NP-Complete
- Proof that Independent Set in Graph theory is NP Complete
- Proof that Clique Decision problem is NP-Complete | Set 2
- Proof that Dominant Set of a Graph is NP-Complete
- Proof that Subgraph Isomorphism problem is NP-Complete
- Proof that Clique Decision problem is NP-Complete
- Algorithms | Analysis of Algorithms (Recurrences) | Question 1
- Algorithms | Analysis of Algorithms (Recurrences) | Question 2
- Algorithms | Analysis of Algorithms | Question 1
- Algorithms | Analysis of Algorithms (Recurrences) | Question 3
- Algorithms | Analysis of Algorithms | Question 2
- Algorithms | Analysis of Algorithms | Question 3