Parameterized proof complexity
(2007)
Presentation / Conference Contribution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given propositional CNF formula cannot be satisfied by a truth assignment that se... Read More about Parameterized proof complexity.