{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:34:30Z","timestamp":1774798470202,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_29","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"281-291","source":"Crossref","is-referenced-by-count":9,"title":["Shannon Entropy vs. Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"An.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-0000(88)90035-9","volume":"36","author":"M. Sipser","year":"1988","unstructured":"Sipser, M.: Expanders, randomness, or time versus space. J. Comput. and System Sci.\u00a036, 379\u2013383 (1988)","journal-title":"J. Comput. and System Sci."},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P., Zurek, W.: Information Distance. IEEE Transactions on Information Theory\u00a044(4), 1407\u20131423 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"#cr-split#-29_CR3.1","doi-asserted-by":"crossref","unstructured":"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);","DOI":"10.1016\/S0304-3975(01)00032-9"},{"key":"#cr-split#-29_CR3.2","unstructured":"Preliminary version in: 14th Annual IEEE Conference on Computational Complexity, Atlanta, May 4-6, pp. 114???122 (1999)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.1999.1677","volume":"60","author":"D. Hammer","year":"2000","unstructured":"Hammer, D., Romashchenko, A., Shen, A., Vereshchagin, N.: Inequalities for Shannon entropy and Kolmogorov complexity. Journal of Computer and Systems Sciences\u00a060, 442\u2013464 (2000)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"29_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"issue":"1","key":"29_CR6","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems Inform. Transmission"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"IT-19","author":"D. Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless Coding of Correlated Information Sources. IEEE Trans. Inform. Theory\u00a0IT-19, 471\u2013480 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A.A. Muchnik","year":"2002","unstructured":"Muchnik, A.A.: Conditional complexity and codes. Theoretical Computer Science\u00a0271, 97\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Sys. Tech. J.\u00a027, 379\u2013423 and 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference, Part 1 and Part 2. Information and Control\u00a07, 1\u201322 and 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01201280","volume":"29","author":"V.A. Uspensky","year":"1996","unstructured":"Uspensky, V.A., Shen, A.: Relations Between Varieties of Kolmogorov Complexities. Mathematical Systems Theory\u00a029(3), 271\u2013292 (1996)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:36Z","timestamp":1619507016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11753728_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}