A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
How to recycle random bits
1989
30th Annual Symposium on Foundations of Computer Science
We show that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r + k 2 ) bits are needed to improve this probability to 1 − 2 −k . We also present a different pseudo-random generator that is optimal, up to a constant factor, in this regard: it uses only O(r + k)
doi:10.1109/sfcs.1989.63486
dblp:conf/focs/ImpagliazzoZ89
fatcat:q5mvnstj35bgzakqan4oqec72e