6 search results - page 1 / 2 » A combinatorial characterization of resolution width |
JCSS
2008
13 years 8 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
ECCC
2010
13 years 7 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
RECOMB
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...