Results 1 
1 of
1
Fixed parameter tractability and completeness IV: On completeness for W[P] and AND PSPACE ANALOGUES
, 2010
"... We describe new results in parameterized complexity theory. In particular, we prove a number of concrete hardness results for W[P], the top level of the hardness hierarchy introduced by Downey and Fellows in a series of earlier papers. We also study the parameterized complexity of analogues of P SP ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
(Show Context)
We describe new results in parameterized complexity theory. In particular, we prove a number of concrete hardness results for W[P], the top level of the hardness hierarchy introduced by Downey and Fellows in a series of earlier papers. We also study the parameterized complexity of analogues of P SP ACE via certain natural problems concerning kmove games. Finally, we examine several aspects of the structural complexity of W[P] and related classes. For instance, we show that W[P] can be characterized in terms of the DTIME(2^o(n)) and NP.