The Complexity of Theorem-Proving Procedures (Cook, 1971)
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:alsoKnownAs |
gptkb:Cook's_theorem_paper
|
| gptkbp:author |
gptkb:Stephen_Cook
|
| gptkbp:citation |
highly cited
|
| gptkbp:countryOfOrigin |
gptkb:Canada
|
| https://www.w3.org/2000/01/rdf-schema#label |
The Complexity of Theorem-Proving Procedures (Cook, 1971)
|
| gptkbp:impact |
foundational in computational complexity theory
|
| gptkbp:introduced |
gptkb:NP-completeness
|
| gptkbp:introducedProblem |
Boolean satisfiability problem
|
| gptkbp:language |
English
|
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:result |
SAT is NP-complete
|
| gptkbp:bfsParent |
gptkb:NP-completeness
|
| gptkbp:bfsLayer |
5
|