A direct proof for Lovett's bound on the communication complexity of low rank matrices

Built on

Extremum problems with inequalities as subsidiary conditions
Fritz John · 1948
Earlier work this paper cites.
Lattices, möbius functions and communication complexity
László Lovász and Michael E. Saks · 1988
Earlier work this paper cites.
On rank vs. communication complexity
Noam Nisan and Avi Wigderson · 1995
Earlier work this paper cites.
The rank and size of graphs
Andrew Kotlov and László Lovász · 1996
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Keith Ball · 1997
Earlier work this paper cites.

Communication complexity
Eyal Kushilevitz and Noam Nisan · 1997
Cited alongside, same era.
Rank and chromatic number of a graph
Andrei Kotlov · 1997
Cited alongside, same era.
Complexity measures of sign matrices
Nati Linial, Shahar Mendelson, Gideon Schechtman, and Adi Shraibman · 2007
Cited alongside, same era.
An additive combinatorics approach relating rank to communication complexity
Eli Ben-Sasson, Shachar Lovett, and Noga Ron-Zewi · 2012
Cited alongside, same era.

Positive semidefinite rank
Original
Hamza Fawzi, João Gouveia, Pablo A. Parrilo, Richard Z. Robinson, and Rekha R. Thomas · 2014
Closest in time.
En route to the log-rank conjecture: New reductions and equivalent formulations
Dmitry Gavinsky and Shachar Lovett · 2014
Closest in time.
Communication is bounded by root of rank
Shachar Lovett · 2014
Closest in time.
The Corruption Bound, Log Rank, and Communication Complexity
Adi Shraibman · 2014
Closest in time.