On multiparty communication with large versus unbounded error
From MaRDI portal
Recommendations
- Separation of unbounded-error models in multi-party communication complexity
- Unbounded-Error Classical and Quantum Communication Complexity
- The unbounded-error communication complexity of symmetric functions
- Improved Separations between Nondeterministic and Randomized Multiparty Communication
- Partition arguments in multiparty communication complexity
Cites work
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- A separation of NP and conp in multiparty communication complexity
- Communication Complexity
- Communication lower bounds using directional derivatives
- Disjointness is hard in the multiparty number-on-the-forehead model
- Halfspace matrices
- Improved separations between nondeterministic and randomized multiparty communication
- Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
- Lower bounds for the approximate degree of block-composed functions
- Majority gates vs. general weighted threshold gates
- Multiparty communication complexity and threshold circuit size of AC^0
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- On the power of small-depth threshold circuits
- Perceptrons, PP, and the polynomial hierarchy
- Probabilistic communication complexity
- Quantum communication complexity of symmetric predicates
- Robust polynomials and quantum algorithms
- Separating AC\(^0\) from depth-2 majority circuits
- Separating deterministic from randomized multiparty communication complexity
- Separation of unbounded-error models in multi-party communication complexity
- The multiparty communication complexity of set disjointness
- The pattern matrix method
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(7)- The hardest halfspace
- The unbounded-error communication complexity of symmetric functions
- Direct sum fails for zero error average communication
- Separation of unbounded-error models in multi-party communication complexity
- Approximate Degree in Classical and Quantum Computing
- Tight bounds for communication-assisted agreement distillation
- Unbounded-Error Classical and Quantum Communication Complexity
This page was built for publication: On multiparty communication with large versus unbounded error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612487)
