Lower bounds for circuits with few modular gates using exponential sums (original) (raw)
Related papers
Lower bounds for circuits with few modular and symmetric gates
2005
Complexity of Modular Circuits
Jacek Krzaczkowski, Paweł Idziak
2021
Lower bound frontiers in arithmetical circuit complexity
2006
Size and Energy of Threshold Circuits Computing Mod Functions
Lecture Notes in Computer Science, 2009
On the computational power of depth 2 circuits with threshold and modulo gates
Proceedings of the twenty-sixth annual ACM …, 1994
Complex polynomials and circuit lower bounds for modular counting
Computational Complexity, 1994
Some results on uniform arithmetic circuit complexity
Mathematical Systems Theory, 1994
New efficient majority circuits for the computation of some basic arithmetic functions
Energy-Efficient Threshold Circuits Computing Mod Functions
International Journal of Foundations of Computer Science, 2013
AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product
2016
AC0∘MOD2 lower bounds for the Boolean Inner Product
Journal of Computer and System Sciences
Lower bounds of the negation-limited circuit complexity
1997
AC0[p] Lower Bounds against MCSP via the Coin Problem
Electron. Colloquium Comput. Complex., 2019
An exponential lower bound for depth 3 arithmetic circuits
1998
On TC0, AC0, and Arithmetic Circuits
Journal of Computer and System Sciences, 2000
Threshold circuit lower bounds on cryptographic functions
2005
Some meet-in-the-middle circuit lower bounds
2004
New algorithms and lower bounds for circuits with linear threshold gates
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014
On Medium-Uniformity and Circuit Lower Bounds
2013 IEEE Conference on Computational Complexity, 2013
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin
Lower bounds for modular counting by circuits with modular gates
Computational Complexity, 1999
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits
Lecture Notes in Computer Science, 2015
Depth reduction for circuits with a single layer of modular counting gates
2009
A new characterization of ACC 0 and probabilistic CC 0
2010
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020
Uniform circuits for division: consequences and problems
Proceedings 16th Annual IEEE Conference on Computational Complexity
New upper bounds on the Boolean circuit complexity of symmetric functions
A. Kojevnikov, E. Demenkov, G. Yaroslavtsev
Information Processing Letters, 2010
Size–energy tradeoffs for unate circuits computing symmetric Boolean functions
Theoretical Computer Science, 2011
Multiparty Communication Complexity and Threshold Circuit Size of AC^ 0
… 2009. FOCS'09. 50th Annual IEEE …, 2009