Kolmogorov Complexity and Combinatorial Methods in Communication Complexity

DOI10.1007/978-3-642-02017-9_29MaRDI QIDQ3630211zbMATH OpenOpenAlexFDO

Authors Sophie Laplante, Marc Kaplan

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_29

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• Kolmogorov complexity and combinatorial methods in communication complexity
• Logical Approaches to Computational Barriers
• Individual communication complexity
• New bounds on classical and quantum one-way communication complexity
• Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

Cited in

(6)

• Communication complexity and combinatorial lattice theory
• scientific article; zbMATH DE number 2038719 (Why is no real title available?)
• Randomized communication complexity of approximating Kolmogorov complexity
• Kolmogorov complexity and combinatorial methods in communication complexity
• Logical Approaches to Computational Barriers
• Lower bounds in communication complexity based on factorization norms

This page was built for publication: Kolmogorov Complexity and Combinatorial Methods in Communication Complexity

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