Bounded fixed-parameter tractability and reducibility

We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some family ℱ . For every family ℱ of functions, this yields a notion of ℱ - fixed-parameter tractability. If ℱ is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of pure and applied logic Ročník 148; číslo 1; s. 1 - 19
Hlavní autoři: Downey, Rod, Flum, Jörg, Grohe, Martin, Weyer, Mark
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.09.2007
Témata:
Parameterized complexity theory
Reductions
Reductions
Parameterized complexity theory
ISSN:0168-0072
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some family ℱ . For every family ℱ of functions, this yields a notion of ℱ - fixed-parameter tractability. If ℱ is the class of all polynomially bounded functions, then ℱ -fixed-parameter tractability coincides with polynomial time decidability and if ℱ is the class of all computable functions, ℱ -fixed-parameter tractability coincides with the standard notion of fixed-parameter tractability. There are interesting choices of ℱ between these two extremes, for example the class of all singly exponential functions. In this article, we study the general theory of ℱ -fixed-parameter tractability. We introduce a generic notion of reduction and two classes ℱ -W[P] and ℱ -XP , which may be viewed as analogues of NP and EXPTIME, respectively, in the world of ℱ -fixed-parameter tractability.
ISSN:0168-0072
DOI:10.1016/j.apal.2007.06.001