Kolmogorov Complexity and Combinatorial Methods in Communication Complexity

DOI10.1007/978-3-642-02017-9_29zbMath1241.68074MaRDI QIDQ3630211

Sophie Laplante, M. A. 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

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

81P45: Quantum information, communication, networks (quantum-theoretic aspects)