The NOF Multiparty Communication Complexity of Composed Functions

DOI10.1007/978-3-642-31594-7_2zbMath1272.68131OpenAlexW35907325WikidataQ62556725 ScholiaQ62556725MaRDI QIDQ2843227

No author found.

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Communication Lower Bounds via Critical Block Sensitivity ⋮ Interleaved Group Products ⋮ The hardest halfspace ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ Simulation theorems via pseudo-random properties

This page was built for publication: The NOF Multiparty Communication Complexity of Composed Functions