Triple
T11438062
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrew Yao |
E271060
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Yao’s minimax principle
Yao’s minimax principle is a fundamental result in computational complexity and randomized algorithms that relates the performance of randomized algorithms to the performance of deterministic algorithms against a worst-case input distribution.
|
E926123
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d6aadeef688190874bcecd88b3dd9b |
elicitation | completed |
| NER | batch_69d8088711ec8190afae9f4d9f2a11ca |
ner | completed |
| NED1 | batch_69e5d38727fc8190b5daac83e03491e6 |
ned_source_triple | completed |
| NED2 | batch_69e5d7fd235081909870476cbc9817b2 |
ned_description | completed |
| NEDg | batch_69e5d5cac9108190b7756329bfa320d3 |
nedg | completed |
Created at: April 8, 2026, 9:35 p.m.