Simultaneous multiparty communication protocols for composed functions

DOI10.4230/LIPICS.MFCS.2018.14MaRDI QIDQ5005112zbMATH OpenFDO

Authors Yassine Hamoudi

Publication date 4 August 2021

Full work available at URL https://arxiv.org/abs/1710.01969

zbMATH Keywords

communication complexitynumber on the forehead model\(\log n\) barriersimultaneous message passingsymmetric composed functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The NOF multiparty communication complexity of composed functions
• The power of super-logarithmic number of players
• The NOF multiparty communication complexity of composed functions
• Communication Complexity of Simultaneous Messages
• Simultaneous messages vs. communication

Cites work

• scientific article; zbMATH DE number 1256775 (Why is no real title available?)
• scientific article; zbMATH DE number 1769898 (Why is no real title available?)
• A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
• An information statistics approach to data stream and communication complexity
• Analysis of Boolean Functions
• Boolean Circuits, Tensor Ranks, and Communication Complexity
• Communication Complexity and Quasi Randomness
• Communication Complexity of Simultaneous Messages
• Communication complexity in a 3-computer model
• Communication lower bounds using directional derivatives
• Disjointness is hard in the multiparty number-on-the-forehead model
• Equality, revisited
• Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
• Multiparty communication complexity and threshold circuit size of AC^0
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Nonuniform ACC circuit lower bounds
• On ACC
• On the power of small-depth threshold circuits
• Rounds in Communication Complexity Revisited
• Simplified lower bounds on the multiparty communication complexity of disjointness
• Simultaneous communication protocols with quantum and classical messages
• Simultaneous messages vs. communication
• The BNS lower bound for multi-party protocols is nearly optimal
• The BNS-Chung criterion for multi-party communication complexity
• The NOF multiparty communication complexity of composed functions
• The communication complexity of interleaved group products
• The multiparty communication complexity of set disjointness
• The pattern matrix method
• The power of super-logarithmic number of players

Cited in

(3)

• The NOF multiparty communication complexity of composed functions
• The power of super-logarithmic number of players
• The NOF multiparty communication complexity of composed functions

This page was built for publication: Simultaneous multiparty communication protocols for composed functions

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