Bounded Fixed-Parameter Tractability: The Case 2^{poly( k)}

Abstract

We introduce a notion of fixed-parameter tractability permitting a parameter dependence of only 2^poly(k). We delve into the corresponding intractability theory. In this course we define the PW-hierarchy, provide some complete problems, and characterize each of its classes in terms of model-checking problems, in terms of propositional satisfiability problems, in terms of logical definitions, and by machine models.

We also locate the complexity of some model-checking problems that are fixed-parameter tractable but not boundedly so.