Triple
T5429796
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Richard Karp |
E121454
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
"Reducibility Among Combinatorial Problems" (1972)
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
|
E519559
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69bd463c65f0819082ee6483ab4b466a |
elicitation | completed |
| NER | batch_69bd883d1bfc8190859bb05cfab065c8 |
ner | completed |
| NED1 | batch_69bf3ac6285081909afa6e91a023f6d5 |
ned_source_triple | completed |
| NED2 | batch_69bf3ce7d6388190a9cd22f76f4420e0 |
ned_description | completed |
| NEDg | batch_69bf3c43ffe88190b8d2a10ea8a9a455 |
nedg | completed |
Created at: March 20, 2026, 2:06 p.m.