Nonuniform Kolmogorov extractors
classification
💻 cs.CC
keywords
randomnessrateamountsourcestringadviceextractingbounds
read the original abstract
We establish tight bounds on the amount on nonuniformity that is necessary for extracting a string with randomness rate 1 from a single source of randomness with lower randomness rate. More precisely, as instantiations of more general results, we show that while O(1) amount of advice regarding the source is not enough for extracting a string with randomness rate 1 from a source string with constant subunitary random rate, \omega(1) amount of advice is.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.