Near-optimal conversion of hardness into pseudo-randomness

Publisher Website
Google Scholar
Abstract
Various efforts have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E=dtime(2O(n)), that requires circuits of size s(n), (for some function s). These results are based on the NW-generator. For the strong lower bound \math, Impagliazzo and Wigderson get the optimal derandomization: P=BPP. However, for weaker lower bound functions s(n), these constructions fall far short of the natural conjecture for optimal derandomization, namely that bptime(t) \math dtime \math. The gap in these constructions is due to an inherent limitation on efficiency in NW-style pseudo-random generators.In this paper we are able to get derandomization in almost optimal time using any lower bound s(n). We do this by using the NW-generator in a new, more sophisticated way. We view any failure of the generator as a reduction from the given ``hard'' function to its restrictions on smaller input sizes. Thus, either the original construction works (almost) optimally, or one of the restricted functions is (almost) as hard as the original. Any such restriction can then be plugged into the NW-generator recursively. This process generates many ``candidate'' generators, and at least one is guaranteed to be ``good''. Then, to perform the approximation of the acceptance probability of the given circuit, we use ideas from Andreev Clementi and Rolim: we run a tournament between the ``candidate'' generators which yields an accurate estimate.Following Trevisan, we explore information theoretic analogs of our new construction. Trevisan used the NW-generator to construct efficient extractors. However, the inherent limitation of the NW-generator mentioned above makes the extra randomness required by that extractor suboptimal (for certain parameters). Applying our construction, we get an almost optimal disperser.

This publication has 11 references indexed in Scilit: