The turing way to parameterized complexity

Journal of Computer and System Sciences

Volumn 67, Issue 4, 2003, Pages 654-685

  Cesati, Marco ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Halting problem; Parameterized complexity; Turing machine; W class membership

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; SET THEORY; THEOREM PROVING;

HALTING PROBLEM; PARAMETERIZED COMPLEXITY; W-CLASS MEMBERSHIP;

TURING MACHINES;

EID: 0346991454     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00073-4     Document Type: Article

References (13)

1. K.R. Abrahamson, R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73 (1995) 235-276.
2. H.L. Bodlaender, B. de Fluiter, Intervalizing k-colored graphs, in: Proceedings of the 22th International Colloquium on Automata, Languages, and Programming (ICALP'95), Lecture Notes in Computer Science, Vol. 944, Spinger, Berlin, 1995, 87-98.
3. H.L. Bodlaender, D. Kratsch, Private communication, 1994.
4. L. Cai, J. Chen, R.G. Downey, M.R. Fellows, The parameterized complexity of short computation and factorization, Arch. Math. Logic 36 (4/5) (1997) 321-337.
5. M. Cesati, Perfect Code is W[1]-complete, Inform. Process. Lett. 81 (3) (2002) 163-168.
6. M. Cesati, M. Di Ianni, Computation models for parameterized complexity, MLQ Math. Log. Q 43 (1997) 179-202.
7. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoret. Comput. Sci. 141 (1995) 109-131.
8. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness I: basic results, SIAM J. Comput. 24 (1995) 873-921.
9. R.G. Downey, M.R. Fellows, Threshold dominating sets and an improved characterization of W[2], Theoret. Comput. Sci. 209 (1998) 123-140.
10. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer, New York, 1999.
11. R.G. Downey, M.R. Fellows, B. Kapron, M.T. Hallet, H.T. Wareham, Parameterized complexity of some problems in logic and linguistics (Extended Abstract), in: Proceedings of Second Workshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming, Lecture Notes in Computer Science, Vol. 813, Springer, Berlin, 1994, pp. 89-101.
12. S. Dreyfus, R. Wagner, The Steiner problem in graphs, Networks 1 (1971) 195-207.
13. H.T. Wareham, The parameterized complexity of intersection and composition operations on sets of finite-state automata, in: Proceedings of the Fifth International Conference on Implementation and Application of Automata, Lecture Notes in Computer Science, Vol. 2088, Springer, Berlin, 2000, 302-310.