Sciweavers

CORR
1999
Springer

Fixed-parameter tractability, definability, and model checking

13 years 3 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For example, we establish the equivalence between the model-checking for existential first-order logic, the homomorphism problem for relational structures, and the substructure isomorphism problem. Our main tractability result shows that model-checking for first-order formulas is fixed-parameter tractable when restricted to a class of input structures with an excluded minor. On the intractability side, for every
Jörg Flum, Martin Grohe
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where CORR
Authors Jörg Flum, Martin Grohe
Comments (0)