Machine-based methods in parameterized complexity theory

Theoretical Computer Science

Volumn 339, Issue 2-3, 2005, Pages 167-199

  Chen, Yijia ^a   Flum, Jörg ^b   Grohe, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Complexity classes; Machine characterizations; Parameterized complexity

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATABASE SYSTEMS; HIERARCHICAL SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING; THEOREM PROVING;

COMPLEXITY CLASSES; FRAMEWORKS; MACHINE CHARACTERIZATIONS; PARAMETERIZED COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 18544382836     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.02.003     Document Type: Article

References (16)

1. H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett, and H.T. Wareham Parameterized complexity analysis in computational biology Comput. Appl. Biosci. 11 1995 49 57
2. L. Cai, J. Chen, R.G. Downey, and M.R. Fellows On the structure of parameterized problems in NP Inform. Comput. 123 1995 38 49
3. Y. Chen, J. Flum, Machine characterizations of the classes of the W-hierarchy, in: M. Baaz, J. Makowsky (Eds.), Proceedings of the 17th International Workshop on Computer Science Logic, Lecture Notes in Computer Science, Vol. 2803, Springer, Berlin, 2003, pp. 114-127.
4. Y. Chen, J. Flum, and M. Grohe Bounded nondeterminism and alternation in parameterized complexity theory Proceedings of the 18th IEEE Conference on Computational Complexity 2003 13 29
5. R.G. Downey, and M.R. Fellows Threshold dominating sets and an improved characterization of W [ 2 ] Theoret. Comput. Sci. 209 1998 123 140
6. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
7. R.G. Downey, M.R. Fellows, K. Regan, Descriptive complexity and the W -hierarchy, in: P. Beame, S. Buss, (Eds.), Proof Complexity and Feasible Arithmetic, AMS-DIMACS Volume Series, Vol. 39, AMS, 1998, pp. 119-134.
8. R.G. Downey, M.R. Fellows, and K. Regan Parameterized circuit complexity and the W-hierarchy Theoret. Comput. Sci. 191 1998 97 115
9. R.G. Downey, M.R. Fellows, and U. Taylor The parameterized complexity of relational database queries and an improved characterization of W [ 1 ] D.S. Bridges C. Calude P. Gibbons S. Reeves I.H. Witten Combinatorics, Complexity, and Logic - Proceedings of DMTCS '96 1996 Springer Berlin 194 213
10. J. Flum, and M. Grohe Fixed-parameter tractability, definability, and model checking SIAM J. Comput. 31 1 2001 113 145
11. J. Flum, M. Grohe, Model-checking problems as a basis for parameterized intractability, Logical Methods in Computer Science 1 (1), 2005.
12. G. Gottlob, N. Leone, M. Sideri, Fixed-parameter complexity in AI and nonmonotonic reasoning, in: M. Gelfond, N. Leone, G. Pfeifer (Eds.), Logic Programming and Nonmonotonic Reasoning, Fifth International Conference, LPNMR'99, Lecture Notes in Computer Science, Vol. 1730, Springer, Berlin, 1999, pp. 1-18.
13. M. Grohe The parameterized complexity of database queries Proceedings of the 20th ACM Symposium on Principles of Database Systems 2001 82 92
14. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading
15. C.H. Papadimitriou, and M. Yannakakis On the complexity of database queries J. Comput. System Sci. 58 1999 407 427
16. U. Stege, Resolving conflicts in problems from computational biology, Ph.D. Thesis, ETH Zuerich, 2000 (Ph.D. Thesis No. 13364).