A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Log-Seed Pseudorandom Generators via Iterated Restrictions

2020
*
Computational Complexity Conference
*

There are only a few known general approaches for constructing explicit pseudorandom generators (PRGs). The "iterated restrictions" approach, pioneered by Ajtai and Wigderson [Ajtai and Wigderson, 1989], has provided PRGs with seed length polylog n or even Õ(log n) for several restricted models of computation. Can this approach ever achieve the optimal seed length of O(log n)? In this work, we answer this question in the affirmative. Using the iterated restrictions approach, we construct an

doi:10.4230/lipics.ccc.2020.6
dblp:conf/coco/DoronHH20
fatcat:ymkmdzvqy5dzfiugl2fg4zneym