Sparse parameterized problems

Annals of Pure and Applied Logic

Volumn 82, Issue 1, 1996, Pages 1-15

  Cesati, Marco ^a   Fellows, Michael R ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295920     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00069-0     Document Type: Article

References (13)

1. K.A. Abrahamson, R.G. Downey and M.R. Fellows, Fixed-parameter intractability II (extended abstract), in: Proc. 10th Ann. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 665 (Würzburg, Germany, February 1993) (Springer, Berlin) 374-385.
2. K.A. Abrahamson, R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73 (3) (1995) 235-276.
3. R.V. Book, Relativizations of the P =?NP and other problems: Developments in structural complexity theory, SIAM Rev. 36 (1994) 157-175.
4. R.G. Downey and M.R. Fellows, Parameterized complexity, Monograph in preparation.
5. R.G. Downey and M.R. Fellows, Fixed-parameter intractability (extended abstract), in: Proc. 7th IEEE Conf. on Structure in Complexity Theory (Boston, June 1992). (IEEE Press, New York) 36-49.
6. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness, Congressus Numerantium 87 (1992) 161-178.
7. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy, in: S. Homer, K. Ambos-Spies and U. Schöning, eds., Complexity Theory: Current Research (Cambridge University Press, Cambridge, 1993) 191-226.
8. R.G. Downey and M.R. Fellows, Parameterized computational feasibility, in: P. Clote and J. Remel, eds., Feasible Mathematics II (Birkhäuser, Boston, 1994) 219-244.
9. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput. (1995) 873-921.
10. R.G. Downey, M.R. Fellows and K.W. Regan, Parameterized circuit complexity and the W hierarchy, Theoret. Comput. Sci. Ser A, to appear.
11. S. Homer and L. Longpré, On reductions of NP sets to sparse sets, in: Proc. 6th IEEE Conf. on Structure in Complexity Theory (1991) 79-88.
12. S. Mahaney, Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis, J. Comput. System Sci. 25 (1982) 130-143.
13. M. Ogiwara and O. Watanabe, On polynomial bounded truth-table reducibility of NP sets to sparse sets, SIAM J. Comput. 20 (1991) 471-483.