Abstract
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolmogorov complexity extractor, thus establishing a fundamental equivalence between two forms of extraction studied in the literature: Kolmogorov extraction and randomness extraction. We present a distribution Mk based on Kolmogorov complexity that is complete for randomness extraction in the sense that a computable function is an almost randomness extractor if and only if it extracts randomness from Mk.
- Barak, B., Impagliazzo, R., and Wigderson, A. 2006. Extracting randomness using few independent sources. SIAM J. Comput. 36, 4, 1095--1118. Google Scholar
Digital Library
- Bourgain, J. 2005. More on the sum-product phenomena in prime fields and its applications. Int. J. Number Theor. 1, 1--32.Google Scholar
Cross Ref
- Buhrman, H., Fortnow, L., Newman, I., and Vereshchagin, N. 2005. Increasing Kolmogorov complexity. In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 3404. Springer, 412--421. Google Scholar
Digital Library
- Chor, B. and Goldreich, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2, 230--261. Google Scholar
Digital Library
- Fortnow, L., Hitchcock, J. M., Pavan, A., Vinodchandran, N. V., and Wang, F. 2011. Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209, 4, 627--636. Google Scholar
Digital Library
- Guruswami, V., Umans, C., and Vadhan, S. P. 2009. Unbalanced expanders and randomness extractors from parvaresh--vardy codes. J. ACM 56, 4. Google Scholar
Digital Library
- Kalai, Y. T., Li, X., and Rao, A. 2009. 2-source extractors under computational assumptions and cryptography with defective randomness. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 617--626. Google Scholar
Digital Library
- Li, M. and Vitányi, P. 1991. Learning simple concepts under simple distributions. SIAM J. Comput. 20, 5, 911--935. Google Scholar
Digital Library
- Li, M. and Vitányi, P. 1992. Average case complexity under the universal distribution equals worst-case complexity. Inf. Process. Lett. 42, 3, 145--149. Google Scholar
Digital Library
- Li, M. and Vitányi, P. 1997. An Introduction to Kolmogorov Complexity and Its Applications. Springer. Google Scholar
Digital Library
- Nisan, N. and Ta-Shma, A. 1999. Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci. 42, 2, 149--167. Google Scholar
Digital Library
- Rao, A. 2006. Randomness extractors for independent sources and applications. Ph.D. thesis, University of Texas, Austin. Google Scholar
Digital Library
- Rao, A. 2008. A 2-source almost-extractor for linear entropy. In Proceedings of the APPROX-RANDOM Conference. Lecture Notes in Computer Science. Springer, 549--556. Google Scholar
Digital Library
- Shaltiel, R. 2004. Current Trends in Theoretical Computer Science. vol 1 Algorithms and Complexity. World Scientific (Chapter Recent Developments in Extractors).Google Scholar
- Zimand, M. 2009. Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence. In Proceedings of the Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. Springer, 607--708.Google Scholar
- Zimand, M. 2010. Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Theory Comput. Syst. 46, 4, 707--722. Google Scholar
Digital Library
Index Terms
Kolmogorov Complexity in Randomness Extraction
Recommendations
On Kurtz randomness
Kurtz randomness is a notion of algorithmic randomness for real numbers. In particular a real x is called Kurtz random (or weakly random) iff it is contained in every computably enumerable set U of (Lebesgue) measure 1. We prove a number of ...
Normality, Randomness and Kolmogorov Complexity of Continued Fractions
Theory and Applications of Models of ComputationAbstractRecently, it has been shown that binary expansion of a number in a unit interval is Martin-Löf random if and only if its continued fraction is Martin-Löf random. In contrast, we show that if the continued fraction expansion of a number in a unit ...
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC 1999We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. These extractors can extract any constant fraction of the min-entropy using O(log2 n) additional random bits, and can extract all the min-...






Comments