Two-party direct-sum questions through the lens of multiparty communication complexity

DOI10.4230/LIPICS.DISC.2017.26MaRDI QIDQ6487499zbMATH OpenFDO

Authors Itay Hazan, Eyal Kushilevitz

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.26

zbMATH Keywords

communication complexitydirect summultiparty communication

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Recommendations

• scientific article; zbMATH DE number 2038719
• How to compress interactive communication
• How to compress interactive communication
• Choosing, agreeing, and eliminating in communication complexity
• Amortized Communication Complexity

Cited in

(5)

• A direct product theorem for two-party bounded-round public-coin communication complexity
• Direct sum fails for zero-error average communication
• Choosing, agreeing, and eliminating in communication complexity
• Consumable data via quantum communication
• Consumable data via quantum communication

This page was built for publication: Two-party direct-sum questions through the lens of multiparty communication complexity

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