{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:05:34Z","timestamp":1725660334180},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276538"},{"type":"electronic","value":"9783642276545"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27654-5_18","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T13:46:33Z","timestamp":1329313593000},"page":"241-246","source":"Crossref","is-referenced-by-count":1,"title":["Symmetry of Information: A Closer Look"],"prefix":"10.1007","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1142\/S0129054110007271","volume":"21","author":"C. Chang","year":"2010","unstructured":"Chang, C., Lyuu, Y., Ti, Y., Shen, A.: Sets of k-independent sets. International Journal of Foundations of Computer Science\u00a021(3), 321\u2013327 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic randomness and complexity","author":"R. Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic randomness and complexity. Springer, Heidelberg (2010)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11786986_30","volume-title":"Automata, Languages and Programming","author":"L. Fortnow","year":"2006","unstructured":"Fortnow, L., Hitchcock, J.M., Pavan, A., Vinodchandran, N.V., Wang, F.: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 335\u2013345. Springer, Heidelberg (2006)"},{"key":"18_CR4","unstructured":"Hitchcock, J., Pavan, A., Vinodchandran, N.V.: Kolmogorov complexity in randomness extraction. In: Electronic Colloquium on Computational Complexity (ECCC), pp. 09\u2013071 (2009)"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"2008","unstructured":"Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer, Heidelberg (2008); 1st edn. (1993)","edition":"3"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-642-15155-2_60","volume-title":"Mathematical Foundations of Computer Science 2010","author":"M. Zimand","year":"2010","unstructured":"Zimand, M.: Counting Dependent and Independent Strings. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 689\u2013700. Springer, Heidelberg (2010)"},{"key":"18_CR7","unstructured":"Zimand, M.: Possibilities and impossibilities in Kolmogorov complexity extraction. SIGACT News\u00a041(4) (December 2010)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Zimand, M.: Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov complexity. In: Proceedings 26th IEEE Conference on Computational Complexity, pp. 148\u2013156 (June 2011)","DOI":"10.1109\/CCC.2011.21"},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A. Zvonkin","year":"1970","unstructured":"Zvonkin, A., Levin, L.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Computation, Physics and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27654-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:59:33Z","timestamp":1556398773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27654-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276538","9783642276545"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27654-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}