Which theorem established Boolean Satisfiability (SAT) as the first NP-Complete problem?
Options
-
A.
Poincare Theorem
-
B.
Cook-Levin Theorem
-
C.
Bayes Theorem
-
D.
More than one of the above
-
E.
None of the above
Correct Answer (Detailed Explanation is Below)
B.
Cook-Levin Theorem
Detailed Explanation
- Cook-Levin Theorem: Proved that the Boolean Satisfiability Problem (SAT) is NP-Complete.
- Stephen Cook: Published the foundational result in 1971.
- Leonid Levin: Independently established a similar result.
- Exam Point: SAT was the first problem proven NP-Complete.
OOps! You are currently offline.