Construction of Very Hard Functions for Multiparty Communication Complexity
From MaRDI portal
Recommendations
Cites work
- A Boolean function requiring 3n network size
- Communication Complexity
- Communication complexity and parallel computing
- Determinism vs. Nondeterminism in Multiparty Communication Complexity
- Multiparty communication complexity and very hard functions
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Optimal lower bounds on the multiparty communication complexity
Cited in
(2)
This page was built for publication: Construction of Very Hard Functions for Multiparty Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494482)