Computer Science – Computational Complexity
Scientific paper
2011-04-05
Computer Science
Computational Complexity
Survey paper published in SIGACT News, Dec. 2010
Scientific paper
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure their quality and also by using individual strings and Kolmogorov complexity to measure their quality. Complexity theorists are more familiar with the first approach. In this paper we survey the second approach. We present the connection between extractors and Kolmogorov extractors and the basic positive and negative results concerning Kolmogorov complexity extraction.
No associations
LandOfFree
Possibilities and impossibilities in Kolmogorov complexity extraction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Possibilities and impossibilities in Kolmogorov complexity extraction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Possibilities and impossibilities in Kolmogorov complexity extraction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-321588