2000 character limit reached
Parameterized Proof Complexity and W[1] (1203.5323v1)
Published 23 Mar 2012 in cs.LO and cs.CC
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.