Cook-Levin theorem

== English == === Etymology === Named after Stephen Cook and Leonid Levin. === Proper noun === the Cook-Levin theorem (computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete. Synonym: Cook's theorem