Sciweavers

Share
FSTTCS
2009
Springer

Kolmogorov Complexity in Randomness Extraction

10 years 5 months ago
Kolmogorov Complexity in Randomness Extraction
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.
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where FSTTCS
Authors John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran
Comments (0)
books