Abstract
The log-rank conjecture states that the communication complexity of a boolean matrix A is bounded by a polynomial in the log of the rank of A. Equival......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
