S. Cook, The complexity of theorem-proving procedures, STOC 1971
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Stephen_Cook
|
| gptkbp:citation |
highly cited
|
| gptkbp:conference |
Annual ACM Symposium on Theory of Computing
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
S. Cook, The complexity of theorem-proving procedures, STOC 1971
|
| gptkbp:introduced |
gptkb:NP-completeness
|
| gptkbp:introducedProblem |
gptkb:Boolean_satisfiability_problem_(SAT)
|
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:STOC
|
| gptkbp:title |
The complexity of theorem-proving procedures
|
| gptkbp:bfsParent |
gptkb:Generalized_Circuit_Value_Problem
|
| gptkbp:bfsLayer |
6
|