Abstract
We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical complexity classes and give, among other things, complete problems and logical descriptions. We then show that most of the well-known intractable parameterized complexity classes are not analogues of classical classes. Nevertheless, for all these classes we can provide natural logical descriptions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.A. Abrahamson, R.G. Downey, and M.R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of pure and applied logic, 73:235–276, 1995.
M. Alekhnovich and A. Razborov. Resolution is not automatizable unless W[P] is tractable. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2001. To appear.
H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett, and H.T. Wareham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11:49–57, 1995.
L. Cai, J. Chen, R.G. Downey, and M.R. Fellows. Advice classes of parameterized tractability. Annals of pure and applied logic, 84:119–138, 1997.
R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24:873–921, 1995.
R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
R.G. Downey, M.R. Fellows, and K. Regan. Descriptive complexity and the W-hierarchy. In P. Beame and S. Buss, editors, Proof Complexity and Feasible Arithmetic, volume 39 of AMS-DIMACS Volume Series, pages 119–134. AMS, 1998.
R.G. Downey, M.R. Fellows, and U. Taylor. The parameterized complexity of relational database queries and an improved characterization of W[1]. In Bridges et al., editors, Combinatorics, Complexity, and Logic’ Proceedings of DMTCS’ 96, pages 194–213. Springer-Verlag, 1996.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 2nd edition, 1999.
H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer-Verlag, 2nd edition, 1994.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings,Vol. 7, pages 43–73, 1974.
J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113–145, 2001.
J. Flum and M. Grohe. Describing parameterized complexty classes. Currently available at http://www.dcs.ed.ac.uk/home/grohe/pub.html.
G. Gottlob, N. Leone, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. In M. Gelfond et al., editors, Logic Programming and Nonmonotonic Reasoning, 5th International Conference, LPNMR’99, volume 1730 of Lecture Notes in Computer Science, pages 1–18. Springer-Verlag, 1999.
M. Grohe. The parameterized complexity of database queries. In Proceedings of the 20th ACM Symposium on Principles of Database Systems, pages 82–92, 2001.
M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 657–666, 2001.
N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16:760–778, 1987.
N. Immerman. Descriptive Complexity. Springer-Verlag, 1999.
C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. In Proceedings of the 17th ACM Symposium on Principles of Database Systems, pages 12–19, 1997.
U. Stege. Resolving Conflicts in Problems from Computational Biology. PhD thesis, ETH Zuerich, 2000. PhD Thesis No.13364.
L.J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.
M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flum, J., Grohe, M. (2002). Describing Parameterized Complexity Classes. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_29
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive