LogRank Conjecture: A prominent open problem positing that the communication complexity of a Boolean function is poly-logarithmically related to the rank of its communication matrix.