Upper semi-lattice of binary strings with the relation “x is simple conditional to y”-Reference-Cited by-同舟云学术

Upper semi-lattice of binary strings with the relation “x is simple conditional to y”

Published:2002-01 Issue:1-2 Volume:271 Page:69-95
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chernov Alexei,Muchnik Andrej,Romashchenko Andrei,Shen Alexander,Vereshchagin Nikolai

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference7 articles.

1. Common information is far less than mutual information;Gács;Problems Control Inform. Theory,1973

2. D. Hammer, A. Romashchenko, A. Shen, N. Vereshchagin, Inequalities for Shannon entropies and Kolmogorov complexities, in: Proc. 12th Annu IEEE Conf. on Computational Complexity, Ulm, Germany, June 1997, pp. 13–23 (Final version: Journal of Computer and System Sciences, 60 (2000), p. 442–464).

3. An Introduction to Kolmogorov Complexity and its Applications;Li,1997

4. An.A. Muchnik, On the extraction of common information of two strings, Abstracts of talks at the First World Congress of Bernoulli Society, Moscow, Nauka, 1986, p. 453 (in Russian).

5. On common information;Muchnik;Theoret. Comput. Sci,1998

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory;ACM Transactions on Computation Theory;2024-09-10

2. An Operational Characterization of Mutual Information in Algorithmic Information Theory;Journal of the ACM;2019-10-31

3. Algorithmic Statistics, Prediction and Machine Learning;LEIBNIZ INT PR INFOR;2016

4. Partial Match Distance;Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence;2013

5. Nonapproximability of the normalized information distance;Journal of Computer and System Sciences;2011-07