Direct products in communication complexity

DOI10.1109/FOCS.2013.85MaRDI QIDQ6981699zbMATH OpenFDO

Authors O. Weinstein, Anup Rao, Mark Braverman, Amir Yehudayoff

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.85

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(5)

• Information dissemination via broadcasts in the presence of adversarial noise
• A strong direct sum theorem for distributional query complexity
• A direct product theorem for quantum communication complexity with applications to device-independent cryptography
• A strong direct sum theorem for distributional query complexity
• Consumable data via quantum communication

This page was built for publication: Direct products in communication complexity

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