Pseudodeterministic Communication Complexity
Year: 2025
Type: preprint
Abstract: We exhibit an $n$-bit partial function with randomized communication complexity $O(\log n)$ but such that any completion of this function into a total one requires randomized communication complexity $n^{Ω(1)}$. In particular, this shows an exponential separation between randomized and \emph{pseudodeterministic} communication protocols. Previously, Gavinsky (2025) showed an analogous separation in the weaker model of parity decision trees. We use lifting techniques to extend his proof idea to communication complexity.
Source: arXiv (Cornell University)
Authors: Göös, Mika, Harms, Nathaniel, Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry, Yuan, Weiqiang
Institutions: University of British Columbia, Université de Montréal
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7104649484
Cites:
Cited by:
Related to: