Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
From MaRDI portal
Publication:3630211
DOI10.1007/978-3-642-02017-9_29zbMath1241.68074OpenAlexW2108238743MaRDI QIDQ3630211
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
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
This page was built for publication: Kolmogorov Complexity and Combinatorial Methods in Communication Complexity