Construction of a point-line incidence problem over the reals with constant randomized CC but linear deterministic CC with equality oracle, improving prior separations.
Sign-rank of k-hamming distance is constant.arXiv preprint arXiv:2506.12022
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Z2-equivariant topological reduction shows sign-rank(GHD_k^n) equals (1-o_k(1))2k with o_k(1) = O(sqrt(log k / k)), improving prior Omega(k/log(n/k)) bounds.
citing papers explorer
-
Communication complexity of point-line incidences over the reals
Construction of a point-line incidence problem over the reals with constant randomized CC but linear deterministic CC with equality oracle, improving prior separations.
-
A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
A Z2-equivariant topological reduction shows sign-rank(GHD_k^n) equals (1-o_k(1))2k with o_k(1) = O(sqrt(log k / k)), improving prior Omega(k/log(n/k)) bounds.