ConceptTheory & Algos
Log-rank conjecture
The conjecture that deterministic communication complexity is always upper bounded by a polylogarithmic function of the rank of the communication matrix.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.