Triple
T594763
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Interactive Proofs and the Hardness of Approximating Cliques |
E17354
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
|
E74456
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a49379d09c8190ac7e00b24e2810b1 |
elicitation | completed |
| NER | batch_69a49bd280ac8190b6a530ce73da85c8 |
ner | completed |
| NED1 | batch_69a518c61744819090ccc037d61a61b1 |
ned_source_triple | completed |
| NED2 | batch_69a519e6319c81908d49076dfe2cd963 |
ned_description | completed |
| NEDg | batch_69a5197869fc8190b3e11f46f4eea7b9 |
nedg | completed |
Created at: March 1, 2026, 7:33 p.m.