Construct · 1 fields · 1 citations

Yao's minimax principle: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Yao's minimaxprinciple1 CONSTRUCTYao's minimax principleYAO · COMPUTATIONAL COMPLEXITY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the principle that the worst-case cost of the best randomized algorithm equals the cost of the best deterministic algorithm against the hardest input distribution.

In computational complexity, Yao's minimax principle refers to the principle that the worst-case cost of the best randomized algorithm equals the cost of the best deterministic algorithm against the hardest input distribution. This meaning comes from Yao (1977) in 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Yao's minimax principle sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructscost4 fields · 4 citationsjingle · one word, four constructsdistribution2 fields · 2 citationsjingle · one word, two constructs

References

  1. Yao, A. C. (1977). Probabilistic computations: Toward a unified measure of complexity. 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). https://doi.org/10.1109/sfcs.1977.24

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct