98 search results - page 1 / 20 » Kolmogorov Complexity in Randomness Extraction |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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 Kolm...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
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 ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...