Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511484n
Noun Named Entity
Categories: Theorems in computational complexity theory, Articles containing proofs
EN
Cook–Levin theorem  Cook-Levin Theorem  Cock-Levin theorem  Cock Levin  Cock–Levin theorem
EN
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. Wikipedia
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist Wikidata
IS A
theorem
NAMED AFTER
Stephen Cook
Leonid Levin
SOLVED BY
Leonid Levin
Wikipedia
EN
Cook–Levin theorem
Wikidata
EN
Cook–Levin theorem
Wikipedia Redirections
EN
Cock-Levin theorem, Cock Levin, Cock–Levin theorem, Cook's theorem, Cook-Levin Theorem, Cook-Levin theorem, Cook levin theorem, Cook theorem, Proof that Boolean satisfiability problem is NP-complete
Wikidata Alias
EN
Cook's theorem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License