firstNPCompleteProblem
P78664
predicate
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
Sample triples (4)
| Subject | Object |
|---|---|
| Cook–Levin theorem | Boolean satisfiability problem NERFINISHED ⓘ |
| Cook–Levin theorem | SAT NERFINISHED ⓘ |
| NP-completeness |
Cook–Levin theorem
ⓘ
surface form:
Boolean satisfiability problem
|
| SAT problem | true ⓘ |