Abstract
We introduce a notion of fixed-parameter tractability permitting a parameter dependence of only 2poly(k). We delve into the corresponding intractability theory. In this course we define the PW-hierarchy, provide some complete problems, and characterize each of its classes in terms of model-checking problems, in terms of propositional satisfiability problems, in terms of logical definitions, and by machine models.
We also locate the complexity of some model-checking problems that are fixed-parameter tractable but not boundedly so.
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
Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and log2n nondeterministic bits. Technical Report 04, Fakultät für Mathematik und Physik, Eckerstraße 1, 79104 Freiburg, Germany (2004)
Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited (2003) (preprint)
Downey, R., Fellows, M.: Parameterized complexity. Springer, New York (1999)
Flum, J., Grohe, M.: Model-checking problems as a basis for parameterized intractability. Technical Report 23, Fakultät für Mathematik und Physik, Eckerstraße 1, 79104 Freiburg, Germany (2003)
Chen, Y., Flum, J.: Machine characterizations of classes of the W-hierarchy. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 114–127. Springer, Heidelberg (2003)
Thomas, W.: Languages, automata, and logic. Technical Report 9607, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany (1996)
Weyer, M.: Dissertation (in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weyer, M. (2004). Bounded Fixed-Parameter Tractability: The Case 2poly( k) . In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive