<?xml version="1.0"?>
<dblp>
<article key="journals/eccc/DantchevMS07" mdate="2009-02-13">
<author>Stefan S. Dantchev</author>
<author>Barnaby Martin</author>
<author>Stefan Szeider</author>
<title>Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.</title>
<year>2007</year>
<volume>14</volume>
<journal>Electronic Colloquium on Computational Complexity (ECCC)</journal>
<ee>http://eccc.hpi-web.de/eccc-reports/2007/TR07-001/index.html</ee>
<number>001</number>
<url>db/journals/eccc/eccc14.html#DantchevMS07</url>
</article>
</dblp>
