91 search results - page 3 / 19 » On the Polynomial Transparency of Resolution |
ECCC
2007
14 years 11 months ago
2007
JSAT
2010
14 years 6 months ago
2010
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
162
click to vote
CC
2010
Springer
14 years 6 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...
94
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
CSL
2002
Springer
14 years 11 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...