2 search results - page 1 / 1 » Pseudorandom Bits for Constant Depth Circuits with Few Arbit... |
COCO
2005
Springer
13 years 6 months 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...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...