Kolmogorov Complexity in Randomness Extraction.

DOI10.4230/LIPIcs.FSTTCS.2009.2320zbMath1248.68268OpenAlexW2243799055MaRDI QIDQ2920128

John M. Hitchcock, N. V. Vinodchandran, A. Pavan

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4680.html

zbMATH Keywords

randomnessextractorsKolmogorov extractors

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Symmetry of Information: A Closer Look ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ On the Optimal Compression of Sets in PSPACE ⋮ On extracting space-bounded Kolmogorov complexity

This page was built for publication: Kolmogorov Complexity in Randomness Extraction.