Some results on uniform arithmetic circuit complexity (original) (raw)
Related papers
An arithmetic model of computation equivalent to threshold circuits
Theoretical Computer Science, 1992
Lower bound frontiers in arithmetical circuit complexity
2006
Journal of Computer and System Sciences, 1981
The Complexity of Boolean Functions in Different Characteristics
computational complexity, 2010
A size-depth trade-off for the analog computation of Boolean functions
Information Processing Letters, 1996
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Definability by constant-depth polynomial-size circuits
1986
On Threshold Circuits and Polynomial Computation
SIAM Journal on Computing, 1992
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences, 2002
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
Theory of Computing Systems / Mathematical Systems Theory, 2007
Dagstuhl Seminar on The Complexity of Boolean Functions
On TC0, AC0, and Arithmetic Circuits
Journal of Computer and System Sciences, 2000
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
Journal of Computer and System Sciences, 1997
Bounded-depth, polynomial-size circuits for symmetric functions
Theoretical Computer Science, 1985
A logic for constant-depth circuits
Information and Control, 1984
New upper bounds on the Boolean circuit complexity of symmetric functions
A. Kojevnikov, E. Demenkov, G. Yaroslavtsev
Information Processing Letters, 2010
New efficient majority circuits for the computation of some basic arithmetic functions
One-way functions and circuit complexity
Information and Computation, 1987
On the complexity of input/output logic
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
An exponential lower bound for depth 3 arithmetic circuits
1998
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
On Medium-Uniformity and Circuit Lower Bounds
2013 IEEE Conference on Computational Complexity, 2013
On the Complexity of Some Arithmetic Problems over F2[T]
Joachim von Zur Gathen, Anna Bernasconi
Kolmogorov Complexity, Circuits, and the Strength of Logical Theories of Arithmetic
2011
On Maximal Boolean Complexity of Boolean Functions⋆
liafa.fr
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics, 2012
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory, 1994
A Purely Logical Characterization of Circuit Uniformity
Structure in Complexity Theory Conference, 1992
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic
2012