Sciweavers

Share
101 search results - page 1 / 21
» Kolmogorov Complexity in Randomness Extraction
Sort
View
FSTTCS
2009
Springer
10 years 6 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 Kolm...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
CORR
2011
Springer
172views Education» more  CORR 2011»
9 years 6 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
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 ...
Marius Zimand
CORR
2011
Springer
147views Education» more  CORR 2011»
9 years 6 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
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...
Marius Zimand
CORR
2008
Springer
115views Education» more  CORR 2008»
9 years 11 months ago
Kolmogorov complexity in perspective
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...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2010
Springer
144views Education» more  CORR 2010»
9 years 9 months ago
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
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...
Marie Ferbus-Zanda, Serge Grigorieff
books