Concept

Cook-Levin Theorem

A foundational theorem in computational complexity theory proving that the Boolean satisfiability problem (SAT) is NP-complete.

Core Facts

3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).

Oct 26

3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).

Partially Verified65%

Sep 2

The Cook-Levin theorem proves that the SAT problem is NP-complete.

Unverified50%

3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).

The Cook-Levin theorem proves that the SAT problem is NP-complete.