Sciweavers

168
Voted
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 11 months ago
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 ...
Yijia Chen, Jörg Flum, Martin Grohe