How to Recycle Random Bits
نویسندگان
چکیده
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) 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) bits to improve the probability to 1 − 2−k. This generator is based on random walks on expanders. Our results do not depend on any unproven assumptions. Next we show that our modified versions of the shift register and linear congruential generators can be used to sample from distributions using, in the limit, the information-theoretic lower bound on random bits.
منابع مشابه
On Optimal Algorithms for Generating Random Bits from Loaded Dice
The problem of generating random bits from an arbitrary biased coin, dating back to von Neumann’s 1951 work, has been extensively studied. Specifically, given a fixed number of biased coin tosses with unknown probability, it is well known how to generate random bits with an asymptotically optimal efficiency. In this paper we address two basic questions related to the generation of random bits. ...
متن کاملHow to Privatize Random Bits
The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols. We consider two cases: (a) the case in which the part privatizing random bits is computationally more powerful than the adversary, and (b) the case in which the part privatizing random bits has a small number of private random bi...
متن کاملEfficiently Generating Random Bits from Finite State Markov Chains
The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann’s 1951 work. Elias (1972) generalized von Neumann’s scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samuelson proposed methods for generat...
متن کاملOn the Power of Advice and Randomization for Online Bipartite Matching
While randomized online algorithms have access to a sequence of uniform random bits, deterministic online algorithms with advice have access to a sequence of advice bits, i.e., bits that are set by an all-powerful oracle prior to the processing of the request sequence. Advice bits are at least as helpful as random bits, but how helpful are they? In this work, we investigate the power of advice ...
متن کاملPairwise Independent Random Variables
In this lecture we discuss how to derandomize algorithms. We will see a brute force algorithm (enumeration) for derandomization. We will also see that some random algorithms do not need true randomness. Specifically, we will see an example where only pairwise random bits are needed. Next, we will see how we can generate pairwise random values and how this conservation on the amount of randomnes...
متن کامل