Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Cook's_theorem
gptkb:Cook–Levin_theorem |
| gptkbp:basisFor |
NP-completeness theory
|
| gptkbp:countryOfOrigin |
gptkb:United_States
|
| gptkbp:field |
computer science
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Cook-Levin theorem
|
| gptkbp:influenced |
gptkb:P_vs_NP_problem
|
| gptkbp:language |
English
|
| gptkbp:provenBy |
gptkb:Stephen_Cook
gptkb:Leonid_Levin |
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:relatedTo |
gptkb:P_vs_NP_problem
NP-complete Boolean satisfiability problem |
| gptkbp:sentence |
The Boolean satisfiability problem (SAT) is NP-complete.
|
| gptkbp:significance |
First theorem to establish an NP-complete problem.
|
| gptkbp:yearProved |
1971
|
| gptkbp:bfsParent |
gptkb:NP-completeness
|
| gptkbp:bfsLayer |
5
|