Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (original) (raw)
Related papers
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
Journal of Computer and System Sciences, 2001
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Lecture Notes in Computer Science
Upper bounds on complexity of Frege proofs with limited use of certain schemata
Archive for Mathematical Logic, 2006
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
Comparison of Proof Sizes in Frege Systems and Substitution Frege Systems
Hakob Nalbandyan, Anahit Chubaryan
2010
Proof Complexities of Some Propositional Formulae Classes in Different Refutation Systems 1
Ashot Abajyan, Anahit Chubaryan
2010
A Dichotomy Theorem for Polynomial Evaluation
On the intrinsic complexity of the arithmetic Nullstellensatz
Journal of Pure and Applied Algebra, 2000
First-Order Reasoning and Efficient Semi-Algebraic Proofs
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Relations between the Proof Complexities in Frege Systems, Deep-Inference Proof Systems KS and еКS
2022
On computational complexity and honest polynomial degrees
Theoretical Computer Science, 1991
Modulo-Counting First-Order Logic on Bounded Expansion Classes
arXiv (Cornell University), 2022
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
computational complexity, 2021
Lower bounds on Nullstellensatz proofs via designs
1998
Bounded Arithmetic and Propositional Proof Complexity
Logic of Computation, 1997
Complete proof systems for algebraic simply-typed terms
ACM SIGPLAN Lisp Pointers, 1994
Combinatorial hardness proofs for polynomial evaluation
Lecture Notes in Computer Science, 1998
Static Inference of Non-Monotonic Polynomial Sized Types
2007
Approximation and small depth Frege proofs
SIAM J. on Computing, Vol. 21, 1161-1179, 1992
The Complexity of Propositional Proofs
The Bulletin of Symbolic Logic, 1995
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
1997
Undecidable existential theories of polynomial rings and function fields
Karim Zahidi, Thanases Pheidas
Communications in algebra, 1999
Mathematical problems of computer science, 2023
Applicable Algebra in Engineering, Communication and Computing, 2006
Complex polynomials and circuit lower bounds for modular counting
Computational Complexity, 1994
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
SIAM Journal on Computing, 1992
Aaecc, 2006
Random Cnf’s are Hard for the Polynomial Calculus
computational complexity, 2010
Abstract Some Results in Computational Complexity
2008
2010
Notes on the decidability of addition and the Frobenius map for polynomials and rational functions
Reports on Mathematical Logic, 2022