Elsevier

Information and Computation

Volume 187, Issue 2, 15 December 2003, Pages 291-319
Information and Computation

Describing parameterized complexity classes

https://doi.org/10.1016/S0890-5401(03)00161-5Get rights and content
Under an Elsevier user license
open archive

Abstract

We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical complexity classes and give, among other things, complete problems and logical descriptions. We then show that most of the well-known intractable parameterized complexity classes are not analogues of classical classes. Nevertheless, for all these classes we can provide natural logical descriptions.

Cited by (0)