论文信息 - Fixed-Parameter Intractability II (Extended Abstract) - 字舞流文

Fixed-Parameter Intractability II (Extended Abstract)

We describe new results in parameterized complexity theory, including an analogue of Ladner's theorem, and natural problems concerning k-move games which are complete for parameterized problem classes that are analogues of P-space.

Michael R. Fellows | Rodney G. Downey | Karl R. Abrahamson

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

[2] Juichi Shinoda,et al. On Pi_2 Theories of hp-T Degrees of Low Sets , 1994, Theor. Comput. Sci..

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

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

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

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

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

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

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

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

[11] RobertsonNeil,et al. Graph minors. XIII , 1994 .

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