Location of Repository

Fixed parameter tractability and completeness IV: On completeness for W[P] and AND PSPACE ANALOGUES

By Karl A. Abrahamson, Rodney G. Downey and Michael R. Fellows

Abstract

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 k-move 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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.170.2870
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mcs.vuw.ac.nz/%7Edo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.