Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SUBCUBE PARTITIONS:
Reports tagged with subcube partitions:
TR15-195 | 3rd December 2015
Robin Kothari

Nearly optimal separations between communication (or query) complexity and partitions

We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Göös, Pitassi, and Watson (FOCS 2015). In query complexity, we establish a nearly quadratic separation between deterministic (and even randomized) ... more >>>




ISSN 1433-8092 | Imprint