70 search results - page 2 / 14 » Improved Pseudorandom Generators for Depth 2 Circuits |
FC
2010
Springer
14 years 11 months ago
2010
Springer
104
Voted
ECCC
2010
14 years 11 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
CC
2005
Springer
14 years 11 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
114
click to vote
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
TIT
2008
14 years 11 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...