Communication complexity

DOI10.1007/978-3-642-19533-4_8MaRDI QIDQ5259198zbMATH OpenOpenAlexFDO

Authors Alexander Razborov

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theoretical computer science (educational aspects) (97P20)

Recommendations

• Communication Complexity
• scientific article; zbMATH DE number 1361468
• scientific article; zbMATH DE number 1361464
• Communication complexity (for algorithm designers)
• scientific article; zbMATH DE number 4147508

Cited in

(12)

• On the complexity of communication complexity
• STACS 2004
• The augmentation property of binary matrices for the binary and Boolean rank
• Space-bounded communication complexity
• An introductory course on communication complexity
• Communication Complexity
• Individual communication complexity
• The communication complexity of addition
• Distributed monitoring of election winners
• scientific article; zbMATH DE number 4147508 (Why is no real title available?)
• Automata, Languages and Programming
• scientific article; zbMATH DE number 2134904 (Why is no real title available?)

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)