An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Descriptive complexity of computable sequences
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
IEEE Transactions on Information Theory
Systems of Strings with High Mutual Complexity
Problems of Information Transmission
Information distance from a question to an answer
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Information shared by many objects
Proceedings of the 17th ACM conference on Information and knowledge management
New information distance measure and its application in question answering system
Journal of Computer Science and Technology
Nonapproximability of the normalized information distance
Journal of Computer and System Sciences
Information distance and its applications
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
C.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W.H. Zurek have defined information distance between two strings x, y as d(x,y)= maxK (x|y), where" K(x|y) is conditional Kolmogorov complexity. It is easy to see that for any string x and any integer n there is a string y such that d(x,y)=n+O(1). In this paper we prove the following (stronger) result: for any n and for any string x such that K(x)≥2n+O(1) there exists a string y such that both K(x|y) and K(y|x) are equal to n+O(1).