Abstract
We consider a non-standard parametrization, where, for problems consisting of a combinatorial structure and a number, we parameterize by the combinatorial structure, rather than by the number. For example, in the Short-Nondeterministic-Halt problem, which is to determine if a nondeterministic machine M accepts the empty string in t steps, we parameterize by |M|, rather than t. We call such parametrization fixed structure parametrization. Fixed structure parametrization not only provides a new set of parameterized problems, but also results in problems that do not seem to fall within the classical parameterized complexity classes. In this paper we take the first steps in understanding these problems. We define fixed structure analogues of various classical problems, including graph problems, and provide complexity, hardness and equivalence results.
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
Cesati, M., Di Ianni, M.: Computational models for parameterized complexity. Mathematical Logic Quarterly 43, 179–202 (1997)
Cesati, M.: Compendium of parameterized problems (2006), http://bravo.ce.uniroma2.it/home/cesati/research/compendium/compendium.pdf
Wareham, T.: The parameterized complexity of intersection and composition operations on sets of finite-state automata. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 302–310. Springer, Heidelberg (2001)
Fernau, H., Hagerup, T., Nishimura, N., Ragde, P., Reinhardt, K.: On the parameterized complexity of a generalized rush hour puzzle. In: Proceedings of Canadian Conference on Computational Geometry, CCCG, pp. 6–9 (2003)
Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 12–14 (1997)
Downey, R.G., Fellows, M.R., Taylor, U.: On the parameteric complexity of relational database queries and a sharper characterization of w[1]. In: Combinatorics, Complexity and Logic, Proceedings of DMTCS 1996 (1996)
Vardi, M.: The complexity of relational query languages. In: Proceedings of the 14th ACM Symposium on Theory of Computing, pp. 137–146 (1982)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: Proceedings of 33rd annual ACM Symposium on Theory of Computing, pp. 657–666 (2001)
Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice Hall, Englewood Cliffs (1981)
Berger, R.: The undecidability of the domino problem. Mem. AMSÂ 66 (1966)
Imrich, W., Klavzer, S.: Product Graphs: Structure and Recognition. Wiley, Chichester (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aumann, Y., Dombb, Y. (2008). Fixed Structure Complexity. In: Grohe, M., Niedermeier, R. (eds) Parameterized and Exact Computation. IWPEC 2008. Lecture Notes in Computer Science, vol 5018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79723-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-79723-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79722-7
Online ISBN: 978-3-540-79723-4
eBook Packages: Computer ScienceComputer Science (R0)