Bounded nondeterminism and alternation in parameterized complexity theory

We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as the class of all parameterized problems decidable by a nondeterministic fixed-parameter tractable algorithm, whose use of nondeterminism is bounded in terms of the parameter. We give similar characterisations for AW[P], the "alternating version of W[P]", and various other parameterized complexity classes. We also give logical characterisations of the classes W[P] and AW[P] in terms of fragments of least fixed-point logic, thereby putting these two classes into a uniform framework that we have developed in earlier work. Furthermore, we investigate the relation between alternation and space in parameterized complexity theory. We prove that the compact Turing machine computation problem, shown to be hard for the class AW[SAT] in (K. A. Abrahamson et al., 1995) is complete for the class uniform-XNL.