Cook–Levin theorem
Sign in to saveAlso known as Cook's theorem
theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Leonid Levin
Show 4 more facts
- Commons category
- Cook-Levin theorem
- maintained by WikiProject
- WikiProject Mathematics
- solved by
- Leonid Levin
- studied by
- computational complexity theory
Sources (1)
via Wikidata · CC0