Exponential lower bound for bounded depth circuits with few threshold gates

Authors:
Vladimir V. Podolskii
Affiliations:
Steklov Mathematical Institute, Gubkina str. 8, 119991, Moscow, Russia
Venue:
Information Processing Letters
Year:
2012

Citing 13
Cited 0

Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
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
Threshold circuits of bounded depth

Journal of Computer and System Sciences
PP is closed under intersection

Selected papers of the 23rd annual ACM symposium on Theory of computing
When do extra majority gates help?: polylog(N) majority gates are equivalent to one

Computational Complexity - Special issue on circuit complexity
Complex polynomials and circuit lower bounds for modular counting

Computational Complexity - Special issue on circuit complexity
Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Complexity measures and decision tree complexity: a survey

Theoretical Computer Science - Complexity and logic
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates

SIAM Journal on Computing
Learning and lower bounds for AC0 with threshold gates

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for circuits with few modular and symmetric gates

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing symmetric boolean functions by circuits with few exact threshold gates

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove an exponential lower bound on the size of bounded depth circuits with O(logn) threshold gates computing an explicit function (namely, the parity function). Previously exponential lower bounds were known only for circuits with one threshold gate. Superpolynomial lower bounds are known for circuits with O(log^2n) threshold gates.