OP-0030Computational complexityOpenThe log-rank conjectureIs deterministic communication complexity polylogarithmic in the rank of the communication matrix?Community consensus· 1988↗