Construct · 1 fields · 1 citations

log-rank conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
log-rankconjecture1 CONSTRUCTLog-rank conjectureLOVASZ · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the conjecture that the deterministic communication complexity of a Boolean function is bounded by a polynomial in the logarithm of its matrix rank.

In computational complexity, log-rank conjecture refers to the conjecture that the deterministic communication complexity of a Boolean function is bounded by a polynomial in the logarithm of its matrix rank. This meaning comes from Lovasz (1988) in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how log-rank conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

communication complexity1 fields · 1 citationsanchor · a standalone constructcomplexity4 fields · 7 citationsjingle · one word, four constructsfunction5 fields · 6 citationsjingle · one word, five constructs

References

  1. Lovasz, L., & Saks, M. (1988). Lattices, mobius functions and communications complexity. [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21924

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct