16 search results - page 1 / 4 » Pseudorandom Generators and Typically-Correct Derandomizatio... |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
ECCC
2010
13 years 7 months ago
2010
ECCC
2011
13 years 2 months ago
2011
We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
ECCC
1998
13 years 7 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
ECCC
2010
13 years 7 months ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...