tree-like resolution proof

ECCC
2007

90views more ECCC 2007»

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution

14 years 12 days ago

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not ﬁxed-parameter tractable. We consider proofs that witness that a given pro...

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider

claim paper

Read More »

click to vote

FOCS
2007
IEEE

113views Theoretical Computer Science» more FOCS 2007»

Parameterized Proof Complexity

14 years 6 months ago

Download www.dur.ac.uk

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not ﬁxedparameter tractable. We consider proofs that witness that a given prop...

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers