2 problems

Let $M$ be an $n\times n$ Boolean matrix, and let randomized communication complexity mean the public-coin randomized communication complexity of $M$. A submatrix is monochromatic…

Log-rank conjecture. For every function $f: \mathcal X \times \mathcal Y \to \{0,1\}$,