Individual communication complexity

DOI10.1016/J.JCSS.2007.03.015zbMath1121.68057DBLPjournals/jcss/BuhrmanKVV07arXivcs/0304012OpenAlexW2132559993WikidataQ58040222 ScholiaQ58040222MaRDI QIDQ2643018

Harry Buhrman, Hartmut Klauck, Paul M. B. Vitányi, Nikolai K. Vereshchagin

Publication date: 23 August 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0304012

zbMATH Keywords

Kolmogorov complexitycommunication complexityindividual complexity

Mathematics Subject Classification ID

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

Related Items (3)

Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ Kolmogorov complexity and combinatorial methods in communication complexity

Cites Work

• New applications of the incompressibility method. II
• Kolmogorov's Structure Functions and Model Selection
• Communication Complexity
• Relations between varieties of kolmogorov complexities
• A formal theory of inductive inference. Part II
• Conditional complexity and codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Individual communication complexity