A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Another Motivation for Reducing the Randomness Complexity of Algorithms
[chapter]
2011
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-642-22670-0_36
fatcat:xfjj2chdqfcxlfw2o2u476tmsi