On public-coin zero-error randomized communication complexity

DOI10.1016/j.ipl.2022.106293OpenAlexW3204704467MaRDI QIDQ2169433

Hamed Hatami, Hamza Usmani, Ben Davis, William Pires, Ran Tao

Publication date: 2 September 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106293

zbMATH Keywords

computational complexitycommunication complexityaverage casezero-error

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A characterization of average case communication complexity
• Private vs. common random bits in communication complexity
• On rank vs. communication complexity
• Communication Complexity
• En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
• Communication Complexity

This page was built for publication: On public-coin zero-error randomized communication complexity