Algebraic proof systems of which the most important are the polynomial calculus and the Nullstellensatz proof system are proof systems that use algebraic means for proving propositional tautologies - they are based on polynomial identities over (commutative) rings. Razborov [9] have proved a non-trivial lower bound on degree for polynomia calculus proofs of the tautologies (a set of polynomials) that express the pigeonhole principle over any field. This work gathers present important results for algebraic proof systems and generalizes the Razborov's construction used in his proof of the lower bound to another set of polynomials. We explicitly describe the basis of the vector space of polynomials that are derivable by a small degree polynomi...
Just as P = NP if and only if some NP-complete set ; is a member of P, the class NP is closed unde...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege p...
AbstractWe introduce two algebraic propositional proof systems F-NS and F-PC. The main difference of...
Polynomial calculus is a Hilbert-style proof system in which lines are polynomials modulo x2 = x (fo...
AbstractWe study possible formulations of algebraic propositional proof systems operating with nonco...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
this paper we are interested in systems that use uses polynomials instead of boolean formulas. From ...
International audienceIt is a known approach to translate propositional formulas into systems of pol...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus ...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Proof complexity studies the complexity of mathematical proofs, with the aim of exhibiting (true) st...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
Just as P = NP if and only if some NP-complete set ; is a member of P, the class NP is closed unde...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege p...
AbstractWe introduce two algebraic propositional proof systems F-NS and F-PC. The main difference of...
Polynomial calculus is a Hilbert-style proof system in which lines are polynomials modulo x2 = x (fo...
AbstractWe study possible formulations of algebraic propositional proof systems operating with nonco...
We introduce a new and very natural algebraic proof system, which has tight connections to (algebrai...
this paper we are interested in systems that use uses polynomials instead of boolean formulas. From ...
International audienceIt is a known approach to translate propositional formulas into systems of pol...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus ...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Proof complexity studies the complexity of mathematical proofs, with the aim of exhibiting (true) st...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
Just as P = NP if and only if some NP-complete set ; is a member of P, the class NP is closed unde...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege p...