An isomorphism between subexponential and parameterized complexity theory

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 314-328

  Chen, Yijia ^a   Grohe, Martin ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; PARAMETERIZATION; THEOREM PROVING; TIME DOMAIN ANALYSIS;

COMPLEXITY THEORY; EXPONENTIAL TIME; ISOMORPHISM; MINIATURIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 34247505632     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.8     Document Type: Conference Paper

References (16)

1. K. Abrahamson, R. Downey, and M. Fellows. Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Annals of Pure and Applied Logic, 73(3): 235-276, 1995.
2. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. In Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP'01), Lecture Notes in Computer Science 2076, 261-272, 2001.
3. T. Brueggemann and W. Kern. An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329(1-3), 303-313, 2004.
4. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer System Science, 67(4), 789-807, 2003.
5. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and Ge Xia. Tight Lower Bounds for Certain Parameterized NP-Hard Problems. In Proceedings of The 19th IEEE Annual Conference on Computational Complexity (CCC'04), 150-160, 2004.
6. J. Chen, X. Huang, I. Kanj, and G. Xia. Linear FPT reductions and computational lower bounds. In Proceedings of the 36th annual ACM symposium on Theory of computing, 212-221, 2004.
7. Y. Chen and J. Flum. On miniaturized problems in parameterized complexity theory. Theoretical Computer Science, 351, 314-336, 2006.
8. S. Demri, F. Laroussinie, and Ph. Schnoebelen. A parametric analysis of the state explosion problem in model checking (extended abstract). In Proceedings of the 19th Annual Symposium on Theoretical. Aspects of Computer Science STAGS '02, volume 2285 of Lecture Notes in Computer Science, 620-631, Springer-Verlag, 2002.
9. R. Downey, V. Estivill, M. Fellows, E. Prieto, and F. Rosamond. Cutting up is hard to do: the parameterized complexity of k-cut and related problems. In Proceedings of Computing: The Australasian Theory Symposium (CATS'03), Electronic Notes in Theoretical Computer Science, 78(0), 1-14, 2003.
10. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
11. J. Flum and M. Grohe. Parameterized complexity and subexponential time. In the Complexity Column of the Bulletin of the European Association for Theoretical Computer Science (EATCS), 84, October, 2004.
12. J. Flum, M. Grohe, and M. Weyer. Limited nondeterminism and parameterized complexity theory. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science 3142, 555-567, 2004.
13. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? Journal of Computer System and Science, 63(4):512-530, 2001.
14. D. Rolf. Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT Electronic Colloquium on Computational Complexity, Report TR05-159, 2005.
15. U. Schöning. Algorithmes in Exponential Time. In Proceedings of 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS '05), Lecture Notes in Computer Science 3404, 36-43, 2005.
16. G. Woeginger. Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). In Proceedings of Parameterized and Exact Computation, First International Workshop (IWPEC '04), Lecture Notes in Computer Science 3162, 281-290, 2004.