{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:46Z","timestamp":1725562906196},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_60","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"689-700","source":"Crossref","is-referenced-by-count":2,"title":["Counting Dependent and Independent Strings"],"prefix":"10.1007","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 384\u2013393 (2004)","DOI":"10.1109\/FOCS.2004.29"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 1\u201310 (2005)","DOI":"10.1145\/1060590.1060592"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J. Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory\u00a01, 1\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"key":"60_CR4","unstructured":"Calude, C.: Information and Randomness: An Algorithmic Perspective., 2nd edn. Springer, Heidelberg (2002); 1st edn. (1994)"},{"key":"60_CR5","unstructured":"Chang, C., Lyuu, Y., Ti, Y., Shen, A.: Sets of k-independent sets. International Journal of Foundations of Computer Science (2009) (to appear)"},{"key":"60_CR6","doi-asserted-by":"crossref","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":"60_CR7","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., Pavan, A., Vinodchandran, N., 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":"60_CR8","unstructured":"Hitchcock, J., Pavan, A., Vinodchandran, N.: Kolmogorov complexity in randomness extraction. In: Electronic Colloquium on Computational Complexity (ECCC) (09-071) (2009)"},{"key":"60_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)"},{"key":"60_CR10","doi-asserted-by":"crossref","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":"60_CR11","doi-asserted-by":"crossref","unstructured":"Rao, A.: Extractors for a constant number of polynomially small min-entropy independent sources. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 497\u2013506 (2006)","DOI":"10.1145\/1132516.1132589"},{"key":"60_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1060590.1060593","volume-title":"STOC","author":"R. Raz","year":"2005","unstructured":"Raz, R.: Extractors with weak random seeds. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 11\u201320. ACM, New York (2005)"},{"key":"60_CR13","unstructured":"Shen, A.: Algorithmic information theory and Kolmogorov complexity. Tech. Rep. 2000-034, Uppsala Universitet (December 2000)"},{"key":"60_CR14","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Math. Fiz. Lapok\u00a048, 436\u2013452 (1941) (in Hungarian)","journal-title":"Math. Fiz. Lapok"},{"key":"60_CR15","unstructured":"Wei, V.: A lower bound on the stability number of a simple graph. Tech. Rep. 81-11217-9, Bell Laboratories (1981)"},{"key":"60_CR16","unstructured":"Zimand, M.: Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence. In: Proceedings 26th STACS, Freiburg, Germany, February 26-29 (2009)"},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Zimand, M.: Impossibility of independence amplification in Kolmogorov complexity theory. In: MFCS (2010)","DOI":"10.1007\/978-3-642-15155-2_61"},{"key":"60_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-79709-8_33","volume-title":"Computer Science \u2013 Theory and Applications","author":"M. Zimand","year":"2008","unstructured":"Zimand, M.: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 326\u2013338. Springer, Heidelberg (2008)"},{"key":"60_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-642-03073-4_51","volume-title":"CiE","author":"M. Zimand","year":"2009","unstructured":"Zimand, M.: On generating independent random strings. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE. LNCS, vol.\u00a05635, pp. 499\u2013508. Springer, Heidelberg (2009)"},{"issue":"6","key":"60_CR20","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","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T20:49:25Z","timestamp":1685738965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}