Sciweavers

14 search results - page 1 / 3
» Resolution over linear equations and multilinear proofs
Sort
View
APAL
2008
84views more  APAL 2008»
13 years 5 months ago
Resolution over linear equations and multilinear proofs
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 ...
Ran Raz, Iddo Tzameret
CC
2010
Springer
112views System Software» more  CC 2010»
12 years 11 months ago
Random Cnf's are Hard for the Polynomial Calculus
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...
Eli Ben-Sasson, Russell Impagliazzo
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 11 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
TAMC
2010
Springer
13 years 10 months ago
Algebraic Proofs over Noncommutative Formulas
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 ...
Iddo Tzameret
FUIN
2008
81views more  FUIN 2008»
13 years 4 months ago
A Cancellation Theorem for BCCSP
This paper presents a cancellation theorem for the preorders in van Glabbeek's linear time-branching time spectrum over BCCSP. Apart from having some intrinsic interest, the p...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...