Which condition must be satisfied for a problem to be NP-Complete?

Options

  • A. It must belong to P only
  • B. It must belong to NP and be NP-Hard
  • C. It must be solvable in constant time
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. It must belong to NP and be NP-Hard

Detailed Explanation

  • NP-Complete = NP + NP-Hard.
  • The problem must belong to NP.
  • Every problem in NP must be polynomial-time reducible to it.
  • Remember: All NP-Complete problems are NP-Hard, but all NP-Hard problems are not necessarily NP-Complete.