2 search results - page 1 / 1 » Pseudorandom generators without the XOR Lemma |
ECCC
1998
13 years 4 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) ...
FOCS
1989
IEEE
13 years 8 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...