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.
Research supported by Victoria University IGC, by the United States / New Zealand Cooperative Science Foundation under grant INT 90-20558, by the University of Victoria, and by the Mathematical Sciences Institute at Cornell University.
Research supported by the National Science and Engineering Research Council of Canada, and the U.S. National Science Foundation under grant MIP-8919312.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, R. Downey, and M. Fellows, “Fixed Parameter Tractability and Completeness IV: W[P] and PSPACE,” to appear.
K. Ambos-Spies and A. Nies, “The Theory of The Polynomial Time Many-One Degrees is Undecidable,” to appear.
K. Ambos-Spies, A. Nies, and R.A. Shore, “The Theory of the Recursively Enumerable Weak Truth Table Degrees is Undecidable,” to appear.
K. Aoki, J. Shinoda, and T. Tsuda, “On Π2 Theories of hp-T Degrees of Low Sets,” to appear.
P. Cholak and R. Downey, “Undecidability and Definability for Parameterized Polynomial Time Reducibilities,” in preparation.
R. Downey, “Nondiamond Theorems for Polymomial Time Reducibility,” to appear, J.C.S.S.
R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness,” Congr. Num., 87 (1992) 161–187.
R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness I: Basic Results,” to appear.
R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness II: On Completeness for W[1],” to appear.
R. Downey and M. Fellows, “Fixed Parameter Intractability (Extended Abstract),” Proc. 7th Conf. on Structure in Complexity Theory (1992), 36–49.
R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W-Hierarchy,” in preparation.
R. Downey and M. Fellows, “Fixed Parameter Tractability,” monograph in preparation.
M. R. Fellows and M. A. Langston, “On Search, Decision and the Efficiency of Polynomial-Time Algorithms.” In Proc. Symp. on Theory of Computing (STOC) (1989), 501–512.
M. R. Fellows and M. A. Langston, “An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite Basis Characterizations.” In Proc. Symp. Foundations of Comp. Sci. (FOCS) (1989), 520–525.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
R. Ladner, “On the Structure of Polynomial Time Reducibility,” J.A.C.M. 22 (1975), 155–171.
N. Robertson and P. D. Seymour, “Graph Minors XIII. The Disjoint Paths Problem,” to appear.
N. Robertson and P. D. Seymour, “Graph Minors XV. Wagner's Conjecture,” to appear.
T. J. Schaefer, “Complexity of Some Two-person Perfect Information Games,” J. Comput. Sys. Sci. 16 (1978), 185–225.
J. Shinoda, Personal Communication, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrahamson, K.A., Downey, R.G., Fellows, M.R. (1993). Fixed-parameter intractability II (extended abstract). In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_38
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive