cff-version: 1.2.0
message: If you use results from this problem page, please cite it as below.
title: "Cairn Commons — The log-rank conjecture in communication complexity"
type: dataset
license: CC-BY-4.0
url: "https://cairn-commons.com/problems/log-rank-conjecture"
date-released: 2026-09-29
authors:
  - name: Cairn Commons contributors
keywords:
  - "complexity"
  - "communication-complexity"
  - "matrix-rank"
  - "discrepancy"
  - "lower-bounds"