Abstract
Recently a mapping 
, the so-called miniaturization mapping, has been introduced and it has been shown that 
faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity [2]. We determine the preimages under 
of various (classes of) problems and show that they coincide with natural reparameterizations which take into account the amount of nondeterminism needed to solve them.
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
Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. In: Proceedings of The 19th IEEE Annual Conference on Computational Complexity (CCC 2004), pp. 150–160 (2004)
Chen, Y., Grohe, M.: An isomorphism between subexponential and parameterized complexity theory. Journal version submitted. A partial conference version appeared In: Proceedings of the 21st IEEE Conference on Computational Complexity (CCC 2006), pp. 314–330 (2006), Available at http://basics.sjtu.edu.cn/~chen/papers/
Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406–451 (1970)
Flum, J., Grohe, M.: Parameterized complexity and subexponential time. In: the Complexity Column of the Bulletin of the European Association for Theoretical Computer Science (EATCS), p. 84 (2004)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and log2 n nondeterministic bits. Journal of Computer and System Sciences 72, 34–71 (2006)
Thatcher, J.W., Wright, J.B.: Generalised finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2, 57–81 (1968)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Flum, J. (2007). Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74915-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74914-1
Online ISBN: 978-3-540-74915-8
eBook Packages: Computer ScienceComputer Science (R0)