Randomized Communication Complexity of Approximating Kolmogorov Complexity
From MaRDI portal
Publication:4981175
DOI10.1007/978-3-319-06686-8_28zbMath1364.68238OpenAlexW290381399MaRDI QIDQ4981175
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_28
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)