Advertisement

Fixed-parameter intractability II (extended abstract)

  • Karl A. Abrahamson
  • Rodney G. Downey
  • Michael R. Fellows
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

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.

Keywords

Parameterized Problem Density Theorem Winning Strategy Game Problem Quantify Boolean Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Abrahamson, R. Downey, and M. Fellows, “Fixed Parameter Tractability and Completeness IV: W[P] and PSPACE,” to appear.Google Scholar
  2. 2.
    K. Ambos-Spies and A. Nies, “The Theory of The Polynomial Time Many-One Degrees is Undecidable,” to appear.Google Scholar
  3. 3.
    K. Ambos-Spies, A. Nies, and R.A. Shore, “The Theory of the Recursively Enumerable Weak Truth Table Degrees is Undecidable,” to appear.Google Scholar
  4. 4.
    K. Aoki, J. Shinoda, and T. Tsuda, “On Π2 Theories of hp-T Degrees of Low Sets,” to appear.Google Scholar
  5. 5.
    P. Cholak and R. Downey, “Undecidability and Definability for Parameterized Polynomial Time Reducibilities,” in preparation.Google Scholar
  6. 6.
    R. Downey, “Nondiamond Theorems for Polymomial Time Reducibility,” to appear, J.C.S.S.Google Scholar
  7. 7.
    R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness,” Congr. Num., 87 (1992) 161–187.Google Scholar
  8. 8.
    R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness I: Basic Results,” to appear.Google Scholar
  9. 9.
    R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness II: On Completeness for W[1],” to appear.Google Scholar
  10. 10.
    R. Downey and M. Fellows, “Fixed Parameter Intractability (Extended Abstract),” Proc. 7th Conf. on Structure in Complexity Theory (1992), 36–49.Google Scholar
  11. 11.
    R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W-Hierarchy,” in preparation.Google Scholar
  12. 12.
    R. Downey and M. Fellows, “Fixed Parameter Tractability,” monograph in preparation.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).Google Scholar
  16. 16.
    R. Ladner, “On the Structure of Polynomial Time Reducibility,” J.A.C.M. 22 (1975), 155–171.Google Scholar
  17. 17.
    N. Robertson and P. D. Seymour, “Graph Minors XIII. The Disjoint Paths Problem,” to appear.Google Scholar
  18. 18.
    N. Robertson and P. D. Seymour, “Graph Minors XV. Wagner's Conjecture,” to appear.Google Scholar
  19. 19.
    T. J. Schaefer, “Complexity of Some Two-person Perfect Information Games,” J. Comput. Sys. Sci. 16 (1978), 185–225.Google Scholar
  20. 20.
    J. Shinoda, Personal Communication, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Karl A. Abrahamson
    • 1
  • Rodney G. Downey
    • 2
  • Michael R. Fellows
    • 3
  1. 1.Department of E.E. & C.S.Washington State UniversityPullmanUSA
  2. 2.Department of MathematicsVictoria University of WellingtonWellingtonNew Zealand
  3. 3.Department of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations