The cost of the missing bit: Communication complexity with help
From MaRDI portal
Publication:700359
DOI10.1007/s004930100009zbMath0996.68057OpenAlexW2611355853MaRDI QIDQ700359
Peter G. Kimmel, László Babai, Thomas P. Hayes
Publication date: 20 October 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930100009
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
The function-inversion problem: barriers and opportunities ⋮ Nondeterministic communication complexity with help and graph functions ⋮ Optimal collapsing protocol for multiparty pointer jumping ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ Unnamed Item ⋮ Improved bounds and schemes for the declustering problem ⋮ The Multiparty Communication Complexity of Set Disjointness ⋮ Communication Lower Bounds Using Directional Derivatives
This page was built for publication: The cost of the missing bit: Communication complexity with help
