The cost of the missing bit: Communication complexity with help
From MaRDI portal
Publication:700359
DOI10.1007/S004930100009zbMATH Open0996.68057OpenAlexW2611355853MaRDI QIDQ700359FDOQ700359
Authors: László Babai, Thomas P. Hayes, Peter G. Kimmel 
Publication date: 20 October 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930100009
Recommendations
- scientific article; zbMATH DE number 1775457
- The value of help bits in randomized and average-case complexity
- Nondeterministic communication complexity with help and graph functions
- The communication complexity of addition
- The communication complexity of addition
- Communication complexity with defective randomness
- On the complexity of communication complexity
- STACS 2004
- Non-deterministic communication complexity with few witnesses
- The cost of fault tolerance in multi-party communication complexity
Cited In (11)
- One-way multiparty communication lower bound for pointer jumping with applications
- Title not available (Why is that?)
- The value of help bits in randomized and average-case complexity
- On the communication complexity of high-dimensional permutations
- Nondeterministic communication complexity with help and graph functions
- The function-inversion problem: barriers and opportunities
- Communication lower bounds using directional derivatives
- Improved bounds and schemes for the declustering problem
- Optimal collapsing protocol for multiparty pointer jumping
- Title not available (Why is that?)
- The multiparty communication complexity of set disjointness
This page was built for publication: The cost of the missing bit: Communication complexity with help
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700359)
