Triple
T3043207
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Stephen Cook |
E83179
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
|
E321037
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad8b2298908190a7cb4e9bdbf064d0 |
elicitation | completed |
| NER | batch_69ad9b5d2a308190b4ce20efcae9b761 |
ner | completed |
| NED1 | batch_69b1ded35e008190be7dd72aa7537a3b |
ned_source_triple | completed |
| NED2 | batch_69b1e0243a848190bce24d035a79fc0a |
ned_description | completed |
| NEDg | batch_69b1dfa2fb28819089d7d76d9dc72e06 |
nedg | completed |
Created at: March 8, 2026, 3:01 p.m.