Author:
Muchnik An.,Vereshchagin N.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Sipser, M.: Expanders, randomness, or time versus space. J. Comput. and System Sci. 36, 379–383 (1988)
2. Bennett, C.H., Gács, P., Li, M., Vitányi, P., Zurek, W.: Information Distance. IEEE Transactions on Information Theory 44(4), 1407–1423 (1998)
3. Chernov, A., Muchnik, A., Romashchenko, A., Shen, A., Vereshchagin, N.: Upper semi-lattice of binary strings with the relation ???x is simple conditional to??y. Theoretical Computer Science??271, 69???95 (2002);
4. Preliminary version in: 14th Annual IEEE Conference on Computational Complexity, Atlanta, May 4-6, pp. 114???122 (1999)
5. Hammer, D., Romashchenko, A., Shen, A., Vereshchagin, N.: Inequalities for Shannon entropy and Kolmogorov complexity. Journal of Computer and Systems Sciences 60, 442–464 (2000)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献