Exponential lower bounds for depth 3 Boolean circuits

Authors:
Ramamohan Paturi;Michael E. Saks;Francis Zane
Affiliations:
Department of Computer Science and Engineering, University of California, San Diego, La Jolla, Ca;Dept. of Mathematics, Rutgers University, New Brunswick, NJ;Department of Computer Science and Engineering, University of California, San Diego, La Jolla, Ca
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Almost optimal lower bounds for small depth circuits

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
The complexity of finite functions

Handbook of theoretical computer science (vol. A)
Introduction to Coding Theory

Introduction to Coding Theory

Derandomizing polynomial identity tests means proving circuit lower bounds

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Hi-index	0.00