Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > CONSTANT-COST COMMUNICATION:
Reports tagged with constant-cost communication:
TR24-064 | 1st April 2024
Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami

No Complete Problem for Constant-Cost Randomized Communication

We prove that the class of communication problems with public-coin randomized constant-cost protocols, called $BPP^0$, does not contain a complete problem. In other words, there is no randomized constant-cost problem $Q \in BPP^0$, such that all other problems $P \in BPP^0$ can be computed by a constant-cost deterministic protocol with ... more >>>


TR25-100 | 15th July 2025
Mika Göös, Nathaniel Harms, Artur Riazanov

Equality is Far Weaker Than Constant-Cost Communication

We exhibit an $n$-bit communication problem with a constant-cost randomized protocol but which requires $n^{\Omega(1)}$ deterministic (or even non-deterministic) queries to an Equality oracle. Therefore, even constant-cost randomized protocols cannot be efficiently "derandomized" using Equality oracles. This improves on several recent results and answers a question from the survey of ... more >>>




ISSN 1433-8092 | Imprint