Parameterized Proof Complexity and W[1]
Logic in Computer Science
2012-03-26 v1 Computational Complexity
Abstract
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower bounds for W[1]-parameterized Resolution.
Cite
@article{arxiv.1203.5323,
title = {Parameterized Proof Complexity and W[1]},
author = {Barnaby Martin},
journal= {arXiv preprint arXiv:1203.5323},
year = {2012}
}