Parameterized Resolution with Bounded Conjunction

We provide separations between the parameterized versions of Res(1) (Resolution) and Res(2). Using a different set of parameterized contradictions, we also separate the parameterized versions of Res*(1) (tree-Resolution) and Res*(2).

[1]  S. Teng,et al.  Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation , 2007, FOCS 2007.

[2]  Barnaby Martin,et al.  Parameterized Proof Complexity , 2010, computational complexity.

[3]  Samuel R. Buss,et al.  A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution , 2004, SIAM J. Comput..

[4]  Maria Luisa Bonet,et al.  Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution , 2002, Inf. Comput..

[5]  J. Krajícek.  On the weak pigeonhole principle , 2001 .

[6]  Maria Luisa Bonet,et al.  On the automatizability of resolution and related propositional proof systems , 2002, Inf. Comput..

[7]  Jochen Messner,et al.  On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution , 2009, ICALP.

[8]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[9]  Pavel Pudlák.  Proofs as Games , 2000, Am. Math. Mon..

[10]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[11]  J. Kraj.  On the Weak Pigeonhole Principle , 2001 .

[12]  Olaf Beyersdorff,et al.  Parameterized Complexity of DPLL Search Procedures , 2011, SAT.

[13]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[14]  Alexander A. Razborov,et al.  Parameterized Bounded-Depth Frege Is Not Optimal , 2011, ICALP.

[15]  Alexander A. Razborov,et al.  Parameterized Bounded-Depth Frege Is not Optimal , 2011, TOCT.

[16]  Barnaby Martin.  Parameterized Proof Complexity and W[1] , 2012, ArXiv.

[17]  Stefan S. Dantchev.  Relativisation Provides Natural Separations for Resolution-Based Proof Systems , 2006, CSR.

[18]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[19]  Olaf Beyersdorff,et al.  Hardness of Parameterized Resolution , 2010, Electron. Colloquium Comput. Complex..