Communication Complexity
From MaRDI portal
Publication:5259198
DOI10.1007/978-3-642-19533-4_8zbMATH Open1314.68164OpenAlexW4249633699MaRDI QIDQ5259198FDOQ5259198
Publication date: 26 June 2015
Published in: An Invitation to Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19533-4_8
Analysis of algorithms and problem complexity (68Q25) Theoretical computer science (educational aspects) (97P20)
Cited In (10)
- On the complexity of communication complexity
- Space-bounded communication complexity
- The augmentation property of binary matrices for the binary and Boolean rank
- Communication Complexity
- Individual communication complexity
- The communication complexity of addition
- Distributed monitoring of election winners
- Title not available (Why is that?)
- Automata, Languages and Programming
- Title not available (Why is that?)
This page was built for publication: Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259198)
