Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy

We analyse basic structural aspects of the reducibilities we use to describe xed parameter tractability and intractability, in the model we introduced in earlier papers in this series. Results include separation and density, the latter for the strongest reducibility.

[1]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[2]  Kurt Mehlhorn,et al.  Polynomial and abstract subrecursive classes , 1974, STOC '74.

[3]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[4]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

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

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

[7]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[8]  V. Rich.  Personal communication , 1989, Nature.

[9]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

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

[11]  Rodney G. Downey.  Nondiamond Theorems for Polynomial Time Reducibility , 1992, J. Comput. Syst. Sci..

[12]  Klaus Ambos-Spies.  On the structure of the polynomial time degrees of recursive sets , 1985, Forschungsberichte.

[13]  André Nies,et al.  The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability , 1992, J. Symb. Log..

[14]  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.

[15]  Kurt Mehlhorn.  Polynomial and Abstract Subrecursive Classes , 1976, J. Comput. Syst. Sci..

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

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

[18]  Richard A. Shore,et al.  The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory , 1992, Theor. Comput. Sci..

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

[20]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

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

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

[23]  Klaus Ambos-Spies,et al.  The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable , 1992, STACS.

[24]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .