An isomorphism between subexponential and parameterized complexity theory

SIAM Journal on Computing

Volumn 37, Issue 4, 2007, Pages 1228-1258

  Chen, Yijia ^a   Grohe, Martin ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Exponential time complexity; Exponential time hypothesis; Parameterized complexity; Subexponential time

Indexed keywords

CANNING; SET THEORY;

EXPONENTIAL TIME COMPLEXITY; EXPONENTIAL TIME HYPOTHESIS; PARAMETERIZED COMPLEXITY; SUBEXPONENTIAL TIME;

CHLORINE COMPOUNDS;

EID: 49449107366     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070687153     Document Type: Article

References (19)

1. K.A. ABRAHAMSON, R.G. DOWNEY, AND M.R. FELLOWS, Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs, Ann. Pure Appl. Logic, 73 (1995), pp. 235-276.
2. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: Exponential speedup for planar graph problems, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming, F. Orejas, PG. Spirakis, and J. van Leeuwen, eds., Lecture Notes in Comput. Sci. 2076, Springer-Verlag, Berlin, 2001, pp. 261-272.
3. T. BRUEGGEMANN AND W. KERN, An improved deterministic local search algorithm for 3-SAT, Theoretical Computer Science, 329 (2004), pp. 303-313.
4. L. CAI AND D. JUEDES, On the existence of subexponential parameterized algorithms, J. Comput. System Sci., 67 (2003), pp. 789-807.
5. J. CHEN, B. CHOR, M. FELLOWS, X. HUANG, D. JUEDES, I. KANJ, AND G. XIA, Tight lower bounds for certain parameterized NP-hard problems, Inform Comput., 201 (2005), pp. 216231.
6. J. CHEN, X. HUANG, I. KANJ, AND G. XIA, Strong computational lower bounds via parameterized complexity, J. Comput. System Sci., 72 (2006), pp. 1346-1367.
7. Y. CHEN AND J. FLUM, On miniaturized problems in parameterized complexity, Theoretical Computer Science, 351 (2006), pp. 314-336.
8. S. DEMRI, F. LAROUSSINIE, AND PH. SCHNOEBELEN, A parametric analysis of the state explosion problem in model checking, in Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, H. Alt and A. Ferreira, eds., Lecture Notes in Comput. Sci. 2285, Springer-Verlag, Berlin, 2002, pp. 620-631.
9. R.G. DOWNEY, V. ESTIVILL-CASTRO, M. FELLOWS, E. PRIETO-RODRIGUEZ, AND F. ROSAMOND, Cutting up is hard to do: The parameterized complexity of k-cut and related problems, in Proceedings of the Australian Theory Symposium, J. Harland, ed., Electron. Notes Theor. Comput. Sci. 78, Elsevier, New York, 2003.
10. R.G. DOWNEY AND M.R. FELLOWS, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput., 24 (1995), pp. 873-921.
11. R.G. DOWNEY AND M.R. FELLOWS, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science, 141 (1995), pp. 109-131.
12. R.G. DOWNEY AND M.R. FELLOWS, Parameterized Complexity, Springer-Verlag, Berlin, 1999.
13. J. FLUM AND M. GROHE, Parameterized complexity and subexponential time, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 84 (2004), pp. 71-100.
14. J. FLUM AND M. GROHE, Parameterized Complexity Theory, Springer-Verlag, Berlin, 2006.
15. 2n nondeterministic bits, J. Comput. System Sci., 72 (2006), pp. 34-71.
16. R IMPAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity? J. Comput. System Sci., 63 (2001), pp. 512-530.
17. D. ROLF, Improved bound for the PPSZ/Schòing-algorithm for 3-SAT, Journal on Satisfiability, Boolean Modeling and Computation, 1 (2006), pp. 111-122.
18. U. SCHÖNING, Algorithmics in exponential time, in Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, V. Diekert and B. Durand, eds., Lecture Notes in Comput. Sci. 3404, Springer-Verlag, Berlin, 2005, pp. 36-43.
19. G. WOEGINGER, Space and time complexity of exact algorithms: Some open problems, in Proceedings of the 1st International Workshop on Parameterized and Exact Computation, R.G. Downey, M. Fellows, and F. Dehne, eds., Lecture Notes in Comput. Sci. 3162, Springer-Verlag, Berlin, 2004, pp. 36-43.