Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Small-bias probability spaces: efficient constructions and applications

SIAM Journal on Computing

Hardness vs randomness

Journal of Computer and System Sciences

Computational Complexity: A Conceptual Perspective

Computational Complexity: A Conceptual Perspective

Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach

Pseudorandom Bit Generators That Fool Modular Sums

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Small-Bias Spaces for Group Products

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Polylogarithmic Independence Can Fool DNF Formulas

SIAM Journal on Computing

Polylogarithmic independence fools AC0 circuits

Journal of the ACM (JACM)

Pseudorandom Bits for Polynomials

SIAM Journal on Computing

Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science

Non-uniform ACC Circuit Lower Bounds

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity