Question:

A problem is NP-complete if it is _______ .

Show Hint

NP-complete problems are both in NP and NP-hard, indicating that they are computationally intensive and have no known polynomial-time solutions.
Updated On: Jun 16, 2025
  • Solvable in polynomial time
  • NP-hard and is NP
  • Reducible to P
  • Non-deterministic but decidable
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

A problem is NP-complete if it is both NP-hard and NP (i.e., it belongs to NP and every other NP problem can be reduced to it in polynomial time). Problems in NP-complete are among the hardest in NP, and no polynomial-time solution has been found for them. Problems like the Traveling Salesman Problem and the Knapsack Problem are classic examples.
Was this answer helpful?
0
0