{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:36:07Z","timestamp":1725536167042},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03351-3_24","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T08:53:58Z","timestamp":1249289638000},"page":"250-262","source":"Crossref","is-referenced-by-count":1,"title":["Variations on Muchnik\u2019s Conditional Complexity Theorem"],"prefix":"10.1007","author":[{"given":"Daniil","family":"Musatov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Musatov, D., Romashchenko, A., Shen, A.: Variations on Muchnik\u2019s Conditional Complexity Theorem. Full version, \n                    \n                      http:\/\/arxiv.org\/abs\/0904.3116"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"5","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S0097539703431032","volume":"35","author":"O. Reingold","year":"2006","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. SIAM Journal on Computing\u00a035(5), 1185\u20131209 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1137\/S009753979834388X","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Fortnow, L., Laplante, S.: Resource bounded Kolmogorov complexity revisited. SIAM Journal on Computing\u00a031(3), 887\u2013905 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"24_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., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"24_CR6","unstructured":"Musatov, D.: Extractors and an effective variant of Muchnik\u2019s theorem. Diplom (Master thesis). Faculty of Mechanics and Mathematics, MSU (2006) (in Russian), \n                    \n                      http:\/\/arxiv.org\/abs\/0811.3958"},{"key":"24_CR7","first-page":"671","volume":"32","author":"A.A. Muchnik","year":"1985","unstructured":"Muchnik, A.A.: On basic structures of the descriptive theory of algorithms. Soviet Math. Dokl.\u00a032, 671\u2013674 (1985)","journal-title":"Soviet Math. Dokl."},{"issue":"1-2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A. Muchnik","year":"2002","unstructured":"Muchnik, A.: Conditional complexity and codes. Theoretical Computer Science\u00a0271(1-2), 97\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","unstructured":"Shen, A.: Combinatorial proof of Muchnik\u2019s theorem. In: Hutter, M., Merkle, W., Vitanyi, P. (eds.) Kolmogorov complexity and applications, Dagstuhl Seminar Proceedings 06051, ISSN 1862\u20134405, \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/625"},{"key":"24_CR10","volume-title":"Proc. of the 15th IEEE Conference on Computational Complexity","author":"H. Buhrman","year":"2004","unstructured":"Buhrman, H., Lee, T., van Melkebeek, D.: Language compression and pseudorandom generators. In: Proc. of the 15th IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2004)"},{"key":"24_CR11","unstructured":"Trevisan, L.: Construction of extractors using pseudo-random generators. In: Proc. 45th FOCS, pp. 264\u2013275"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D. Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Transactions on information Theory\u00a019, 471\u2013480 (1973)","journal-title":"IEEE Transactions on information Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T02:57:59Z","timestamp":1552100279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}