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:25, 26 June 2019 (Created the page as a stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The log rank conjecture is a conjecture in communication complexity relating 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=903520398"