Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:alsoKnownAs |
Cook's 1971 paper
Cook's paper |
| gptkbp:author |
gptkb:Stephen_Cook
|
| gptkbp:citation |
over 10,000
|
| gptkbp:contribution |
Introduced the concept of NP-completeness
Proved that the Boolean satisfiability problem (SAT) is NP-complete |
| gptkbp:countryOfPublication |
gptkb:United_States
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:influenced |
Richard Karp's 1972 paper on NP-completeness
|
| gptkbp:language |
English
|
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:title |
gptkb:The_Complexity_of_Theorem-Proving_Procedures
|
| gptkbp:topic |
gptkb:NP-completeness
gptkb:P_vs_NP_problem gptkb:Boolean_satisfiability_problem |
| gptkbp:url |
https://dl.acm.org/doi/10.1145/800157.805047
|
| gptkbp:bfsParent |
gptkb:The_Complexity_of_Theorem-Proving_Procedures_(Cook,_1971)
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cook's theorem paper
|