Before revision: In communication complexity, the log-rank conjecture states a relation between the deterministic communication complexity of a two party Boolean function to the rank of its input matrix.
After revision: In communication complexity, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix.