ConceptTheory & Algos
Mehlhorn-Schmidt theorem
A theorem stating that the deterministic communication complexity of a function is bounded below by the logarithm of the rank of its communication matrix over the reals.
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.
Deterministic communication complexity1Matrix rank1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.