Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > WEAKLY UNBOUNDED ERROR COMMUNICATION COMPLEXITY:
Reports tagged with weakly unbounded error communication complexity:
TR19-067 | 6th May 2019
Hamed Hatami, Kaave Hosseini, Shachar Lovett

Sign rank vs Discrepancy

Revisions: 1

Sign-rank and discrepancy are two central notions in communication complexity. The seminal work of Babai, Frankl, and Simon from 1986 initiated an active line of research that investigates the gap between these two notions.
In this article, we establish the strongest possible separation by constructing a Boolean matrix whose sign-rank ... more >>>




ISSN 1433-8092 | Imprint