Sciweavers

73 search results - page 1 / 15
» The Strength of Multilinear Proofs
Sort
View
CC
2008
Springer
13 years 4 months ago
The Strength of Multilinear Proofs
We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arith...
Ran Raz, Iddo Tzameret
APAL
2008
84views more  APAL 2008»
13 years 4 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
CAV
2012
Springer
222views Hardware» more  CAV 2012»
11 years 7 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
CC
2008
Springer
150views System Software» more  CC 2008»
13 years 4 months ago
Balancing Syntactically Multilinear Arithmetic Circuits
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
Ran Raz, Amir Yehudayoff
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 4 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx