Triple
T1531384
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Introduction to Algorithms |
E32449
|
entity |
| Predicate | coversTopic |
P380
|
FINISHED |
| Object |
NP-completeness
NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
|
E173625
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a885ea86308190998f6bc14bb91f8e |
elicitation | completed |
| NER | batch_69a90816b5e88190aa92a8558e35744b |
ner | completed |
| NED1 | batch_69ad2957e6e4819087504a16bc32d60b |
ned_source_triple | completed |
| NED2 | batch_69ad2a8deae8819095731fdd1b4bd310 |
ned_description | completed |
| NEDg | batch_69ad2a18a79c81908f04ba9aa55d52a0 |
nedg | completed |
Created at: March 4, 2026, 7:26 p.m.