{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:04Z","timestamp":1725472024764},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_30","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"335-345","source":"Crossref","is-referenced-by-count":18,"title":["Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws"],"prefix":"10.1007","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[]},{"given":"John M.","family":"Hitchcock","sequence":"additional","affiliation":[]},{"given":"A.","family":"Pavan","sequence":"additional","affiliation":[]},{"given":"N. V.","family":"Vinodchandran","sequence":"additional","affiliation":[]},{"given":"Fengming","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing (to appear)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/FOCS.2004.29","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science","author":"B. Barak","year":"2004","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 384\u2013393. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"30_CR3","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":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. In: Proceedings of the 26th Annual IEEE Conference on Foundations of Computer Science, pp. 429\u2013442 (1985)","DOI":"10.1109\/SFCS.1985.62"},{"key":"30_CR5","unstructured":"Hitchcock, J.M.: Effective Fractal Dimension: Foundations and Applications. PhD thesis, Iowa State University (2003)"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/1086649.1086662","volume":"36","author":"J.M. Hitchcock","year":"2005","unstructured":"Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: The fractal geometry of complexity classes. SIGACT News\u00a036(3), 24\u201338 (2005)","journal-title":"SIGACT News"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ipl.2005.05.001","volume":"95","author":"J.M. Hitchcock","year":"2005","unstructured":"Hitchcock, J.M., Pavan, A.: Resource-bounded strong dimension versus resource-bounded category. Information Processing Letters\u00a095(3), 377\u2013381 (2005)","journal-title":"Information Processing Letters"},{"key":"30_CR8","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.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, Berlin (1997)","edition":"2"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Lu, C.-J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to a constant factor. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 602\u2013611 (2003)","DOI":"10.1145\/780542.780630"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J.H. Lutz","year":"1992","unstructured":"Lutz, J.H.: Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences\u00a044(2), 220\u2013258 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1137\/S0097539701417723","volume":"32","author":"J.H. Lutz","year":"2003","unstructured":"Lutz, J.H.: Dimension in complexity classes. SIAM Journal on Computing\u00a032(5), 1236\u20131259 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"30_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"42","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences\u00a042(2), 149\u2013167 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences\u00a052(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: Proceedings of the 41st Annual Conference on Foundations of Computer science (2000)","DOI":"10.1109\/SFCS.2000.892008"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proceedings of the 41st Annual IEEE Conference on Foundations of Computer Science (2000)","DOI":"10.1109\/SFCS.2000.892006"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Santha, M., Vazirani, U.: Generating quasi-random sequences from slightly random sources. In: Proceedings of the 25th Annual IEEE Conference on Foundations of Computer Science, pp. 434\u2013440 (1984)","DOI":"10.1109\/SFCS.1984.715945"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: Proceedings of the 42nd Annual Conference on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959941"},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1137\/S009753979630091X","volume":"28","author":"A. Srinivasan","year":"1999","unstructured":"Srinivasan, A., Zuckerman, D.: Computing with very weak random sources. SIAM Journal on Computing\u00a028(4), 1433\u20131459 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zuckerman, D., Safra, M.: Extractors from reed-muller codes. In: Proceedings of the 42nd Annual Conference on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959940"},{"issue":"1","key":"30_CR21","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L. Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM\u00a048(1), 860\u2013879 (2001)","journal-title":"Journal of the ACM"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z","volume":"11","author":"D. Zuckerman","year":"1997","unstructured":"Zuckerman, D.: Randomness-optimal oblivious sampling. Random Structures and Algorithms\u00a011, 345\u2013367 (1997)","journal-title":"Random Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:47Z","timestamp":1619507987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11786986_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}