Lower bounds for circuits with few modular and symmetric gates (original) (raw)
Related papers
Bounded-depth, polynomial-size circuits for symmetric functions
Theoretical Computer Science, 1985
An exponential lower bound for depth 3 arithmetic circuits
1998
On the computational power of depth 2 circuits with threshold and modulo gates
Proceedings of the twenty-sixth annual ACM …, 1994
Lower bounds for circuits with few modular gates using exponential sums
2006
Lower bound frontiers in arithmetical circuit complexity
2006
A super-quadratic lower bound for depth four arithmetic circuits
Proceedings of the 35th Computational Complexity Conference, 2020
Depth reduction for circuits with a single layer of modular counting gates
2009
New upper bounds on the Boolean circuit complexity of symmetric functions
A. Kojevnikov, E. Demenkov, G. Yaroslavtsev
Information Processing Letters, 2010
Complexity of Modular Circuits
Jacek Krzaczkowski, Paweł Idziak
2021
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin
Some results on uniform arithmetic circuit complexity
Mathematical Systems Theory, 1994
Bounded Depth Arithmetic Circuits: Counting and Closure
Lecture Notes in Computer Science, 1999
Bounds on the Power of Constant-Depth Quantum Circuits
Lecture Notes in Computer Science, 2005
New algorithms and lower bounds for circuits with linear threshold gates
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
Lower bounds of the negation-limited circuit complexity
1997
The complexity of computing symmetric functions using threshold circuits
Theoretical Computer Science, 1992
Communication complexity towards lower bounds on circuit depth
2002
Some meet-in-the-middle circuit lower bounds
2004
Theoretical Computer Science, 2008
Complex polynomials and circuit lower bounds for modular counting
Computational Complexity, 1994
ArXiv, 2020
On Threshold Circuits and Polynomial Computation
SIAM Journal on Computing, 1992
Depth-efficient threshold circuits for multiplication and symmetric function computation
Lecture Notes in Computer Science, 1996
Lower Bounds against Weakly Uniform Circuits
Lecture Notes in Computer Science, 2012
Constant depth circuits and the Lutz hypothesis
Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997
2007
Evaluating spectral norms for constant depth circuits with symmetric gates
Computational Complexity, 1995