8 search results - page 2 / 2 » Lower Bounds for the Weak Pigeonhole Principle Beyond Resolu... |
APAL
2008
13 years 4 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
SIAMCOMP
2002
13 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...