Computation models for parameterized complexity

Mathematical Logic Quarterly

Volumn 43, Issue 2, 1997, Pages 179-202

  Cesati, Marco ^a   Di Ianni, Miriam ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Computational complexity; Parameterized computational complexity; Turing machine

Indexed keywords

EID: 0040653891     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19970430204     Document Type: Article

References (9)

1. CAI, L., J. CHEN, R. G. DOWNEY, and M. R. FELLOWS, On the parameterized complexity of short computation and factorization. To appear in the Archive for Mathematical Logic.
2. DOWNEY, R. G., and M. R. FELLOWS, Fixed-parameter intractability (extended abstract). In: Proceedings of the 7th IEEE Conference on Structure in Complexity Theory, Boston June 1992, pp. 36-49.
3. DOWNEY, R. G., and M. R. FELLOWS, Fixed-parameter tractabuity and completeness. Congressus Numerantium 87 (1992), 161-178.
4. DOWNEY, R. G., and M. R. FELLOWS, Parameterized computational feasibility. In: Feasible Mathematics II (P. CLOTE and J. REMEL, eds.), Birkha"user, Boston 1994.
5. DOWNEY, R. G., and M. R. FELLOWS, Fixed-parameter tractability and completeness I: Basic results. SIAM J. Computing 24 (1995), 873-921.
6. DOWNEY, R. G., and M. R. FELLOWS, Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoret. Comp. Sci 141 (1995), 109-131.
7. GAREY, M. R., and D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York 1979.
8. HOPCROFT, J. E., and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publ. Comp., New York 1979.
9. LEWIS, H. R., and C. H. PAPADIMITRIOU, Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs, N.J., 1981.