Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Cook's_completeness_theorem
gptkb:Cook's_theorem |
| gptkbp:author |
gptkb:Stephen_Cook
gptkb:Leonid_Levin |
| 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
theory of NP-completeness |
| gptkbp:influencedBy |
cryptography
algorithm design complexity classes |
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:relatedTo |
gptkb:NP-completeness
gptkb:P_vs_NP_problem Boolean satisfiability problem |
| gptkbp:sentence |
Boolean satisfiability problem is NP-complete
|
| gptkbp:significance |
first proof that an NP-complete problem exists
|
| gptkbp:yearProved |
1971
|
| gptkbp:bfsParent |
gptkb:Stephen_Cook
gptkb:P_vs_NP_problem |
| gptkbp:bfsLayer |
5
|