Pages that link to "Item:Q1961057"
From MaRDI portal
The following pages link to Lower bounds for the polynomial calculus and the Gröbner basis algorithm (Q1961057):
Displayed 11 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Exploring the vacuum geometry of \(\mathcal N=1\) gauge theories (Q879888) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
- Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)