Pseudorandomness from Shrinkage

  title={Pseudorandomness from Shrinkage},
  author={Russell Impagliazzo and Raghu Meka and David Zuckerman},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
One powerful theme in complexity theory and pseudorandomness in the past few decades has been the use lower bounds to give pseudorandom generators (PRGs). However, the general results using this hardness vs. randomness paradigm suffer a quantitative loss in parameters, and hence do not give nontrivial implications for models where we don't know superpolynomial lower bounds but do know lower bounds of a fixed polynomial. We show that when such lower bounds are proved using random restrictions… CONTINUE READING
Highly Cited
This paper has 70 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 49 extracted citations

70 Citations

Citations per Year
Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…