Randomized communication complexity of Point-Line Incidence is Theta(log n), the first constant support-rank example with super-constant complexity.
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
No Constant-Cost Protocol for Point--Line Incidence
Randomized communication complexity of Point-Line Incidence is Theta(log n), the first constant support-rank example with super-constant complexity.