70 search results - page 1 / 14 » Improved Pseudorandom Generators for Depth 2 Circuits |
APPROX
2010
Springer
14 years 12 days ago
2010
Springer
COCO
2005
Springer
14 years 24 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...
FSTTCS
2001
Springer
14 years 3 months ago
2001
Springer
ECCC
1998
13 years 10 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) ...
DSD
2005
IEEE
14 years 24 days ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...