Assuming P ≠ NP, which of the following is TRUE?

GATE · 2012 · CS · Computer Science & IT

1. A.

   NP-complete = NP

2. B.

   NP-complete ∩ P = $\phi$

3. C.

   NP-hard = NP

4. D.

   P = NP-complete

Attempted by 163 students.