Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues

Abstract We describe new results in parametrized 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 parametrized complexity of analogues of PSPACE 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.

[1]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[2]  Liming Cai,et al.  On fixed-parameter tractability and approximability of NP-hard optimization problems , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[3]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[4]  Michael R. Fellows,et al.  Parameterized learning complexity , 1993, COLT '93.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[7]  Kenneth W. Regan.  Finitary Substructure Languages. , 1989 .

[8]  Mihalis Yannakakis,et al.  On Limited Nondeterminism and the Complexity of the V-C Dimension , 1996, J. Comput. Syst. Sci..

[9]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[10]  Robert E. Tarjan,et al.  A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[11]  Peter Cholak,et al.  Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities , 1993 .

[12]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[13]  Michael R. Fellows,et al.  DNA Physical Mapping: Three Ways Difficult , 1993, ESA.

[14]  Michael R. Fellows,et al.  Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy , 1993 .

[15]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[16]  Michael R. Fellows,et al.  Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy , 1994, STOC '94.

[17]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[18]  Phokion G. Kolaitis,et al.  Approximation properties of NP minimization classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[19]  Michael T. Hallett,et al.  The Parameterized Complexity of Some Problems in Logic and Linguistics , 1994, LFCS.

[20]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[21]  Patrick C. Fischer,et al.  Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations , 1980, SIAM J. Comput..

[22]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[23]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[24]  Michael R. Fellows,et al.  Fixed-Parameter Complexity and Cryptography , 1993, AAECC.

[25]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[26]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[27]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[28]  Michael R. Fellows,et al.  Fixed-Parameter Intractability II (Extended Abstract) , 1993, STACS.

[29]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[30]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  M. Fellows,et al.  Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy , 1994, Symposium on the Theory of Computing.

[32]  Liming Cai,et al.  On the parameterized complexity of short computation and factorization , 1997, Arch. Math. Log..