Jump to content

Cook-Levin theorem

From Wiktionary, the free dictionary

English

[edit]
English Wikipedia has an article on:
Wikipedia

Etymology

[edit]

Named after Stephen Cook and Leonid Levin.

Proper noun

[edit]

the Cook-Levin theorem

  1. (computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete.
    Synonym: Cook's theorem
Retrieved from "https://en.wiktionary.org/w/index.php?title=Cook-Levin_theorem&oldid=84012057"