The Complexity of Theorem-Proving Procedures
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:alsoKnownAs |
gptkb:Cook's_theorem_paper
|
| gptkbp:author |
gptkb:Stephen_Cook
|
| gptkbp:citation |
over 10,000
|
| gptkbp:contribution |
Introduced the concept of NP-completeness
Proved the Boolean satisfiability problem (SAT) is NP-complete |
| gptkbp:doi |
10.1145/800157.805047
|
| gptkbp:field |
computer science
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
The Complexity of Theorem-Proving Procedures
|
| gptkbp:impact |
Foundational paper in computational complexity
|
| gptkbp:language |
English
|
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:bfsParent |
gptkb:P_versus_NP_problem
gptkb:SAT_problem |
| gptkbp:bfsLayer |
6
|