Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity

Theoretical Computer Science

Volumn 259, Issue 1-2, 2001, Pages 613-622

  Grigoriev, Dima ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Boolean binomial system; Positivstellensatz calculus proofs; Tseitin tautologies

Indexed keywords

BOOLEAN FUNCTIONS; POLYNOMIALS;

POSITIVSTELLENSATZ CALCULUS;

THEOREM PROVING;

EID: 0034920157     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00157-2     Document Type: Article

References (20)

1. Lower bounds on Hilbert's Nullstellensatz and propositional proofs
2. Bounds for the degrees in the Nullstellensatz
3. Linear gaps between degrees for polynomial calculus modulo distinct primes
4. Linear gaps between degrees for polynomial calculus modulo distinct primes
5. Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
6. Using the Groebner basis algorithm to find proofs of unsatisfiability
7. Nullstellensatz lower bounds for Tseitin tautologies
8. Complexity of Null- and Positivstellensatz proofs
9. Lower bounds for polynomial calculus and the Groebner basis algorithm
10. Stable sets and polynomials
11. Cones of matrices and set-functions and 0-1 optimization
12. Ramanujan graphs
13. Explicit group-theoretical construction of combinatorial schemes and their applications to the design of expanders and concentrators
14. Lower bounds for the polynomial calculus
15. A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
16. On the complexity of derivations in propositional calculus
17. The complexity of propositional proofs