Communication Lower Bounds Via the Chromatic Number

DOI10.1007/978-3-540-77050-3_19MaRDI QIDQ5458837zbMATH OpenOpenAlexFDO

Authors Ravi Kumar, D. Sivakumar

Publication date 24 April 2008

Published in FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77050-3_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Lower bounds in communication complexity
• On the ``log rank-conjecture in communication complexity
• Nondeterministic communication complexity with help and graph functions
• Some order dimension bounds for communication complexity problems

Cites work

• scientific article; zbMATH DE number 3468645 (Why is no real title available?)
• scientific article; zbMATH DE number 2038719 (Why is no real title available?)
• scientific article; zbMATH DE number 780788 (Why is no real title available?)
• An information statistics approach to data stream and communication complexity
• Approximate graph coloring by semidefinite programming
• Communication Complexity
• Communication Complexity of Simultaneous Messages
• Entropy and sorting.
• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• On the Shannon capacity of a graph
• Perfect graphs and graph entropy: An updated survey
• Privacy, additional information and communication
• Space lower bounds for distance approximation in the data stream model
• Two applications of information complexity

Cited in

(6)

• Nondeterministic communication complexity with help and graph functions
• Lower bounds in communication complexity
• The zero-error side information problem and chromatic numbers (Corresp.)
• Lower bounds in communication complexity based on factorization norms
• Coloring chains for compression with uncertain priors
• Round elimination in exact communication complexity

This page was built for publication: Communication Lower Bounds Via the Chromatic Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458837)