Abstract
We observe that the randomness-complexity of an algorithm effects the time-complexity of implementing a version of it that utilizes a weak source of randomness (through a randomness-extractor). This provides an additional motivation for the study of the randomness complexity of randomized algorithms. We note that this motivation applies especially in the case that derandomization is prohibitingly costly. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Goldreich, O. (2011). Another motivation for reducing the randomness complexity of algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 555–560. https://doi.org/10.1007/978-3-642-22670-0_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
