Which of the following is NOT an NP-Complete problem?
Asked In:
BPSC TRE 3.0
Options
-
A.
Traveling Salesman Problem
-
B.
Boolean Satisfiability Problem
-
C.
Shortest Path Problem
-
D.
More than one of the above
-
E.
None of the above
Correct Answer (Detailed Explanation is Below)
C.
Shortest Path Problem
Detailed Explanation
- NP-Complete: A problem that belongs to NP and is NP-Hard.
- Traveling Salesman Problem (Decision Version): NP-Complete.
- Boolean SAT: The first problem proven to be NP-Complete (Cook-Levin theorem).
- Shortest Path Problem: Belongs to P because it can be solved in polynomial time using Dijkstra's or Bellman-Ford algorithm.
OOps! You are currently offline.