Advertisement

Beyond W[t]-Hardness

  • Rodney G. Downey
  • Michael R. Fellows
Part of the Texts in Computer Science book series (TCS)

Abstract

We introduce the classes W[P] and variations, proving a number of concrete hardness and membership results for this level of the W-hierarchy.

Keywords

Positive Integer Model Check Turing Machine Truth Assignment Satisfying Assignment 
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.

References

  1. 2.
    K. Abrahamson, R. Downey, M. Fellows, Fixed-parameter intractability II, in Proceedings of 10th Annual Symposium on Theoretical Aspects on Computer Science, STACS 93, Würzburg, Germany, February 25–27, 1993, ed. by P. Enjalbert, A. Finkel, K. Wagner. LNCS, vol. 665 (Springer, Berlin, 1993), pp. 374–385 Google Scholar
  2. 3.
    K. Abrahamson, R. Downey, M. Fellows, Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Log. 73(3), 235–276 (1995) MathSciNetCrossRefMATHGoogle Scholar
  3. 6.
    K. Abrahamson, M. Fellows, J. Ellis, M. Mata, On the complexity of fixed parameter problems, in Proceedings of 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, Research Triangle Park, North Carolina, USA, 30 October–1 November 1989 (IEEE Comput. Soc., Los Alamitos, 1989), pp. 210–215 Google Scholar
  4. 136.
    M. Cesati, The Turing way to parameterized complexity. J. Comput. Syst. Sci. 67(4), 654–685 (2003) MathSciNetCrossRefMATHGoogle Scholar
  5. 247.
    R. Downey, M. Fellows, Parameterized Complexity. Monographs in Computer Science (Springer, Berlin, 1999) CrossRefGoogle Scholar
  6. 248.
    R. Downey, M. Fellows, B. Kapron, M. Hallett, T. Wareham, The parameterized complexity of some problems in logic and linguistics, in Logical Foundations of Computer Science, Proceedings of Third International Symposium, LFCS’94, St. Petersburg, Russia, July 11–14, 1994, ed. by A. Nerode, Y. Matiyasevich. LNCS, vol. 813 (Springer, Berlin, 1994), pp. 89–101 CrossRefGoogle Scholar
  7. 312.
    J. Flum, M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series (Springer, Berlin, 2006) Google Scholar
  8. 337.
    M. Garey, D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979) MATHGoogle Scholar
  9. 490.
    D. Lichtenstein, Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982) MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Rodney G. Downey
    • 1
  • Michael R. Fellows
    • 2
  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria UniversityWellingtonNew Zealand
  2. 2.School of Engineering and Information TechnologyCharles Darwin UniversityDarwinAustralia

Personalised recommendations