Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a notion of “typically-correct” deterministic simulations, which are allowed to err on few inputs. In this paper we further the study of typically-correct derandomization in two ways.
First, we develop a generic approach for constructing typically-correct derandomizations based on seed-extending pseudorandom generators, which are pseudorandom generators that reveal their seed. We use our approach to obtain both conditional and unconditional typically-correct derandomization results in various algorithmic settings. We show that our technique strictly generalizes an earlier approach by Shaltiel based on randomness extractors, and simplifies the proofs of some known results. We also demonstrate that our approach is applicable in algorithmic settings where earlier work did not apply. For example, we present a typically-correct polynomial-time simulation for every language in BPP based on a hardness assumption that is weaker than the ones used in earlier work.
Second, we investigate whether typically-correct derandomization of BPP implies circuit lower bounds. Extending the work of Kabanets and Impagliazzo for the zero-error case, we establish a positive answer for error rates in the range considered by Goldreich and Wigderson. In doing so, we provide a simpler proof of the zero-error result. Our proof scales better than the original one and does not rely on the result by Impagliazzo, Kabanets, and Wigderson that NEXP having polynomial-size circuits implies that NEXP coincides with EXP.
Unable to display preview. Download preview PDF.
- 2.Feigenbaum, J., Fortnow, L.: Random-self-reducibility of complete sets. SICOMP 22(5) (1993)Google Scholar
- 5.Håstad, J.: Computational limitations of small-depth circuits. MIT Press, Cambridge (1987)Google Scholar
- 15.Reingold, O.: Undirected connectivity in log-space. JACM 55(4) (2008)Google Scholar
- 16.Shaltiel, R.: Weak derandomization of weak algorithms: explicit versions of Yao’s lemma. In: Proc. Conf. Comput. Compl. (2009)Google Scholar
- 17.Shaltiel, R., Umans, C.: Low-end uniform hardness vs. randomness tradeoffs for AM. In: Proc. of the ACM Symp. Theory of Comp., pp. 430–439 (2007)Google Scholar
- 23.Zimand, M.: Exposure-resilient extractors. In: Proc. Conf. Comput. Compl., pp. 61–72 (2006)Google Scholar