We use our dispersers to derandomize results of Hastad [23] and Feige-Kilian [19] and show that for all ε>0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1-ε are NP-hard.Expand

An (m; n; b; r)-erasure-resilient coding scheme consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of n packets each… Expand

The authors describe a simple universal strategy S/sup univ/, with the property that, for any algorithm A, T(A,S) is the best performance that can be achieved, up to a constant factor, by any universal strategy.Expand

It is shown that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm.Expand

A is a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable.Expand

For any fixed /spl epsiv/>0, we show how to simulate RP algorithms in time n/sup O(log n/) using the output of a /spl delta/-source with min-entropy R/sup /spl Omega/(1/), which is optimal.Expand

We give an efficient deterministic algorithm that extracts almost-random bits from sources where $n^{\frac{1}{2}+\gamma} of the $n$ bits are uniformly random and the rest are fixed in advance.Expand