Search
❯
Jun 18, 20261 min read
The Cook-Levin Theorem states that the Boolean Satisfiability Problem (SAT) is NP-complete.