3 search results - page 1 / 1 » Hard Sets and Pseudo-random Generators for Constant Depth Ci... |
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
COCO
2005
Springer
15 years 1 days ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...