Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Cook–Levin_theorem
|
| gptkbp:citation |
thousands of scientific papers
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
gptkb:Levin's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cook's theorem
|
| gptkbp:implies |
all problems in NP can be reduced to SAT in polynomial time
|
| gptkbp:influenced |
the study of NP-complete problems
|
| gptkbp:proposedBy |
gptkb:Stephen_Cook
|
| gptkbp:provenBy |
polynomial-time reduction
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Third_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:relatedTo |
gptkb:NP-completeness
gptkb:P_vs_NP_problem |
| gptkbp:sentence |
The Boolean satisfiability problem (SAT) is NP-complete.
|
| gptkbp:significance |
established the concept of NP-completeness
|
| gptkbp:yearProposed |
1971
|
| gptkbp:bfsParent |
gptkb:NP-completeness
|
| gptkbp:bfsLayer |
5
|