# SAT is NP-complete

Last edited: 2025-12-05

# Statement

Cook-Levin Theorem (1971)

The Satisfiability problem is NP-complete .

# Proof

This is long.