Choosing, agreeing, and eliminating in communication complexity

DOI10.1007/978-3-642-14165-2_39zbMATH Open1288.68064OpenAlexW1559523647MaRDI QIDQ3587399FDOQ3587399

Authors: Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.8101

Recommendations

• Choosing, agreeing, and eliminating in communication complexity
• The communication complexity of enumeration, elimination, and selection
• How to compress interactive communication
• The choice and agreement problems of a random function
• Two-party direct-sum questions through the lens of multiparty communication complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (3)

• Choosing, agreeing, and eliminating in communication complexity
• The communication complexity of enumeration, elimination, and selection
• Two-party direct-sum questions through the lens of multiparty communication complexity

This page was built for publication: Choosing, agreeing, and eliminating in communication complexity

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