Cook-Levin theorem

English

Etymology

Named after Stephen Cook and Leonid Levin.

Proper noun

the Cook-Levin theorem

  1. (computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete.
    Synonym: Cook's theorem
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.