{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:33Z","timestamp":1725517173512},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_43","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"527-538","source":"Crossref","is-referenced-by-count":0,"title":["A Random Oracle Does Not Help Extract the Mutual Information"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"43_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/rm1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The Complexity of Finite Objects and the Algorithmic Concepts of Information and Randomness. Russian Math. Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Math. Surveys"},{"key":"43_CR2","first-page":"49","volume":"2","author":"P. G\u00e1cs","year":"1973","unstructured":"G\u00e1cs, P., K\u00f6rner, J.: Common Information Is far Less Than Mutual Information. Problems of Control and Information Theory\u00a02, 49\u201362 (1973)","journal-title":"Problems of Control and Information Theory"},{"key":"43_CR3","unstructured":"Ahlswede, R., K\u00f6rner, J.: On Common Information and Related Characteristics of Correlated Information Sources. In: Proc. 7th Prague Conf. on Inf. Th. Stat. Dec. Fct\u2019s and Rand (1974)"},{"key":"43_CR4","doi-asserted-by":"crossref","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.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1109\/18.681320","volume":"44","author":"Z. Zhang","year":"1998","unstructured":"Zhang, Z., Yeung, R.W.: On Characterization of Entropy Functions via Information Inequalities. IEEE Trans. on Information Theory\u00a044, 1440\u20131452 (1998)","journal-title":"IEEE Trans. on Information Theory"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(98)00070-X","volume":"207","author":"A.A. Muchnik","year":"1998","unstructured":"Muchnik, A.A.: On Common Information. Theoretical Computer Science\u00a0207, 319\u2013328 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"43_CR7","first-page":"1","volume":"36","author":"A. Romashchenko","year":"2000","unstructured":"Romashchenko, A.: Pairs of Words with Nonmaterializable Mutual Information. Problems of Information Transmission\u00a036(1), 1\u201318 (2000)","journal-title":"Problems of Information Transmission"},{"key":"43_CR8","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 System Sciences\u00a060, 442\u2013464 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"43_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.4310\/CIS.2002.v2.n2.a3","volume":"2","author":"K. Makarychev","year":"2002","unstructured":"Makarychev, K., Makarychev, Yu., Romashchenko, A., Vereshchagin, N.: A New Class of non Shannon Type Inequalities for Entropies. Communications in Information and Systems\u00a02(2), 147\u2013166 (2002)","journal-title":"Communications in Information and Systems"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(01)00034-2","volume":"271","author":"A. Romashchenko","year":"2002","unstructured":"Romashchenko, A., Shen, A., Vereshchagin, N.: Combinatorial Interpretation of Kolmogorov Complexity. Theoretical Computer Science\u00a0271, 111\u2013123 (2002)","journal-title":"Theoretical Computer Science"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00032-9","volume":"271","author":"A. Chernov","year":"2002","unstructured":"Chernov, A., Muchnik, A.A., Shen, A., Romashchenko, A., Vereshchagin, N.K.: Upper Semi-Lattice of Binary Strings with the Relation \u201cx Is Simple Conditional to y\u201d. Theoretical Computer Science\u00a0271, 69\u201395 (2002)","journal-title":"Theoretical Computer Science"},{"key":"43_CR12","unstructured":"Romashchenko, A.: Extracting the Mutual Information for a Triple of Binary Strings. In: Proc. 18th Annual IEEE Conference on Computational Complexity (2003)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:31:32Z","timestamp":1619523092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}