Correction to: ``Communication complexity with small advantage

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

Authors: 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

Recommendations

• Communication complexity with small advantage
• scientific article; zbMATH DE number 7250149
• Communication complexity of correlated equilibrium with small support
• Errata for: ``On randomized one-round communication complexity
• Corrigendum to ‘Mixing, Communication Complexity and Conjectures of Gowers and Viola’
• The corruption bound, log-rank, and communication complexity
• A note on non-deterministic communication complexity with few witnesses
• STACS 2004
• A comparison of two lower bound methods for communication complexity (extended abstract)

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Cited In (1)

• Corrigendum to ‘Mixing, Communication Complexity and Conjectures of Gowers and Viola’

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777910)