Triple
T5335897
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | P, NP, and NP-Completeness: The Basics of Complexity Theory |
E123824
|
entity |
| Predicate | mainTopic |
P31
|
FINISHED |
| Object |
Cook–Levin theorem
The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
|
E512972
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69bd464b07f8819095aa76577c9829e4 |
elicitation | completed |
| NER | batch_69bd85af799081909ee60bfbb65149ee |
ner | completed |
| NED1 | batch_69bf18be4bb88190a2b83e51716e677e |
ned_source_triple | completed |
| NED2 | batch_69bf1a198418819089b25102733f9191 |
ned_description | completed |
| NEDg | batch_69bf194c53a48190b0895bbe9aa2f6f1 |
nedg | completed |
Created at: March 20, 2026, 2 p.m.