Parameterized Proof Complexity and W[1]
classification
💻 cs.LO
cs.CC
keywords
parameterizedcomplexityprogramproofaimsalreadyboundsclasses
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.