Correction to: ``Communication complexity with small advantage

DOI10.1007/S00037-020-00193-9zbMATH Open1442.68059OpenAlexW3032096333MaRDI QIDQ777910

D. Kharzeev

Publication date: 8 July 2020

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-020-00193-9

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Errata for: ``On randomized one-round communication complexity 👍 👎
• A note on non-deterministic communication complexity with few witnesses 👍 👎
• The corruption bound, log-rank, and communication complexity 👍 👎
• Communication complexity with small advantage 👍 👎
• A comparison of two lower bound methods for communication complexity 👍 👎
• STACS 2004 👍 👎
• Corrigendum to ‘Mixing, Communication Complexity and Conjectures of Gowers and Viola’ 👍 👎

This page was built for publication: Correction to: ``Communication complexity with small advantage