Pseudodeterministic Communication Complexity
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909891681058816 |
|---|---|
| author | Göös, Mika Harms, Nathaniel Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang |
| author_facet | Göös, Mika Harms, Nathaniel Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04794 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Pseudodeterministic Communication Complexity Göös, Mika Harms, Nathaniel Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang Computational Complexity 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. |
| title | Pseudodeterministic Communication Complexity |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2511.04794 |