ConceptTheory & Algos
Yao's minimax principle
A theorem stating that the randomized communication complexity of a task equals the distributional complexity under the worst-case input distribution.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Distributional communication complexity1Randomized communication complexity1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.