The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
From MaRDI portal
Recommendations
- Optimal lower bounds on the multiparty communication complexity
- scientific article; zbMATH DE number 1688365
- Lower bounds on the multiparty communication complexity
- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
- A separation of NP and conp in multiparty communication complexity
- Separating deterministic from randomized multiparty communication complexity
- Communication Complexity and Lower Bounds on Multilective Computations
- A note on multiparty communication complexity and the Hales-Jewett theorem
- On the exact round complexity of best-of-both-worlds multi-party computation
Cited in
(13)- A three-party communication problem
- A note on multiparty communication complexity and the Hales-Jewett theorem
- Nondeterministic communication complexity with help and graph functions
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- A direct product theorem for two-party bounded-round public-coin communication complexity
- One-round multi-party communication complexity of distinguishing sums
- The NOF multiparty communication complexity of composed functions
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
- On the communication complexity of high-dimensional permutations
- scientific article; zbMATH DE number 7559107 (Why is no real title available?)
- The communication complexity of addition
- Automata, Languages and Programming
- Finding large 3-free sets. I. The small \(n\) case
This page was built for publication: The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756728)
