352 search results - page 1 / 71 » Proofs as Polynomials |
JSC
2007
13 years 6 months ago
2007
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also r...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
JAT
2006
13 years 6 months ago
2006
Abstract. Recently M. Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another pro...
CC
2010
Springer
13 years 1 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...