Sciweavers

351 search results - page 71 / 71
» Classical Logic with Partial Functions
Sort
View
ECCC
2007
90views more  ECCC 2007»
13 years 10 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
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 pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider