scientific article; zbMATH DE number 7378331
From MaRDI portal
Publication:5005112
DOI10.4230/LIPIcs.MFCS.2018.14MaRDI QIDQ5005112
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1710.01969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
communication complexitynumber on the forehead model\(\log n\) barriersimultaneous message passingsymmetric composed functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The NOF multiparty communication complexity of composed functions
- An information statistics approach to data stream and communication complexity
- Disjointness is hard in the multiparty number-on-the-forehead model
- On the power of small-depth threshold circuits
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- The BNS lower bound for multi-party protocols is nearly optimal
- On ACC
- Communication complexity in a 3-computer model
- A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
- The Multiparty Communication Complexity of Set Disjointness
- Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$
- The communication complexity of interleaved group products
- Equality, Revisited
- Nonuniform ACC Circuit Lower Bounds
- The Pattern Matrix Method
- Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
- Rounds in Communication Complexity Revisited
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Communication Complexity of Simultaneous Messages
- Simultaneous messages vs. communication
- Analysis of Boolean Functions
- Communication Complexity and Quasi Randomness
- Communication Lower Bounds Using Directional Derivatives
- The BNS-Chung criterion for multi-party communication complexity
This page was built for publication:
