Kolmogorov Complexity in Randomness Extraction.
From MaRDI portal
Publication:2920128
DOI10.4230/LIPIcs.FSTTCS.2009.2320zbMath1248.68268MaRDI 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
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
68W20: Randomized algorithms
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Extracting Kolmogorov complexity with applications to dimension zero-one laws, On extracting space-bounded Kolmogorov complexity, Symmetry of Information: A Closer Look, On the Optimal Compression of Sets in PSPACE