Arithmetic Circuits and Polynomial Replacement Systems (original) (raw)
Related papers
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
computational complexity, 2007
Descriptive complexity of circuit-based counting classes
2021
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)
On proving circuit lower bounds against the polynomial-time hierarchy
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
A Dichotomy Theorem for Polynomial Evaluation
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
computational complexity, 2004
Lower bound frontiers in arithmetical circuit complexity
2006
Combinatorial hardness proofs for polynomial evaluation
Lecture Notes in Computer Science, 1998
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
Electron. Colloquium Comput. Complex., 2018
Abstract Some Results in Computational Complexity
2008
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
Corr, 2003
Arithmetic Circuits and Identity Testing
2009
Definability by constant-depth polynomial-size circuits
1986
On the counting complexity of propositional circumscription
Information Processing Letters, 2008
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
Computational Complexity, 1996
Polynomials and Combinatorial Definitions of Languages
Complexity Theory Retrospective II, 1997
Algebraic and Combinatorial Circuits
2008
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science, 2005
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic
2012
Satisfiability in multi-valued circuits
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
On the Decidability of Termination for Polynomial Loops
arXiv (Cornell University), 2019
Efficient counting of models for boolean formulas represented by embedded cycles
2007
The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15, 2015
Complexity of Generalized Satisfiability Counting Problems
Information and Computation, 1996
Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
Journal of Artificial Intelligence Research
Using Symbolic Summation and Polynomial Algebra for Imperative Program Verification in Theorema 1
2006
Bounded Depth Arithmetic Circuits: Counting and Closure
Lecture Notes in Computer Science, 1999
Parameterized complexity via combinatorial circuits
2007
On polynomial time computation over unordered structures
Journal of Symbolic Logic, 2002