Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity theorem
|
| gptkbp:appliesTo |
randomized algorithms
decision tree complexity |
| gptkbp:formedBy |
gptkb:Andrew_Yao
|
| https://www.w3.org/2000/01/rdf-schema#label |
Yao's Minimax Principle
|
| gptkbp:publishedIn |
Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977)
|
| gptkbp:relatedTo |
gptkb:minimax_theorem
randomized complexity deterministic complexity |
| gptkbp:state |
the expected cost of the best randomized algorithm is at least the expected cost of the best deterministic algorithm under the worst-case input distribution
|
| gptkbp:usedFor |
proving lower bounds for randomized algorithms
|
| gptkbp:yearProposed |
1977
|
| gptkbp:bfsParent |
gptkb:Yao's_Principle
gptkb:姚期智 |
| gptkbp:bfsLayer |
7
|