Jump to content

Log-rank conjecture

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yuval Filmus (talk | contribs) at 04:29, 26 June 2019 (Added "unsolved" template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Unsolved problem in computer science
Prove or disprove the log rank conjecture.
More unsolved problems in computer science

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.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Log-rank_conjecture&oldid=903520772"