文章基本信息
- 标题：On public-coin zero-error randomized communication complexit
- 本地全文：下载
- 作者：Ben Davis ; Hamed Hatami ; Pooya Hatami 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2021
- 卷号：21
- 语种：English
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We prove that for every Boolean function, the public-coin zero-error randomized communication complexity and the deterministic communication complexity are polynomially equivalent.
