Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity principle
|
| gptkbp:alsoKnownAs |
gptkb:Yao's_Minimax_Principle
|
| gptkbp:appliesTo |
randomized algorithms
decision tree complexity |
| gptkbp:citation |
many complexity theory papers
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:formedBy |
gptkb:Andrew_Yao
|
| https://www.w3.org/2000/01/rdf-schema#label |
Yao's Principle
|
| gptkbp:publishedIn |
gptkb:FOCS_1977
|
| gptkbp:state |
The expected cost of the best randomized algorithm on the worst-case input is at least the expected cost of the best deterministic algorithm against a worst-case input distribution.
|
| gptkbp:usedFor |
complexity analysis
lower bounds |
| gptkbp:yearProposed |
1977
|
| gptkbp:bfsParent |
gptkb:Andrew_Chi-Chih_Yao
gptkb:Andrew_Yao |
| gptkbp:bfsLayer |
6
|