Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Cook–Levin_theorem
|
| gptkbp:appliesTo |
gptkb:decision_problems
|
| gptkbp:basisFor |
the theory of NP-completeness
|
| gptkbp:category |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:formedBy |
gptkb:Stephen_Cook
|
| gptkbp:generalizes |
gptkb:Levin's_theorem
|
| gptkbp:influenced |
computational complexity research
|
| gptkbp:provenBy |
SAT is as hard as any problem in NP
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:relatedTo |
gptkb:P_versus_NP_problem
|
| gptkbp:significance |
established the concept of NP-completeness
|
| gptkbp:state |
the Boolean satisfiability problem (SAT) is NP-complete
|
| gptkbp:yearProposed |
1971
|
| gptkbp:bfsParent |
gptkb:Cook–Levin_theorem
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cook's completeness theorem
|