Threshold dominating sets and an improved characterization of W[2]

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 123-140

  Downey, Rodney G ^a   Fellows, Michael R ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Boolean circuits; Dominating sets; Parameterized complexity; Satisfiability problems; Threshold computation

Indexed keywords

EID: 0006724332     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00101-1     Document Type: Article

References (16)

1. K.A. Abrahamson, R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs, Ann. Pure Appl. Logic 73 (1995) 235-276.
2. H. Bodlaender, R.G. Downey, M.R. Fellows, M. Hallett, H.T. Wareham, Parameterized complexity analysis in computational biology, Comput. Appl. Biosci. 11 (1995) 49-57.
3. H. Bodlaender, R.G. Downey, M.R. Fellows, H.T. Wareham, The parameterized complexity of the longest common subsequence problem, Theoret. Comput. Sci. A 147 (1995) 31-54.
4. H. Bodlaender, M.R. Fellows, On the complexity of k-processor scheduling, Oper. Res. Lett. 18 (1995) 93-98.
5. H. Bodlaender, M.R. Fellows, M. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, Proc. ACM Symp. on the Theory of Computing (STOC) (1994) 449-458.
6. L. Cai, J. Chen, R.G. Downey, M.R. Fellows, On the parameterized complexity of short computation and factorization, Arch. for Math. Logic., to appear.
7. M. Cesati, H.T. Wareham, Parameterized complexity analysis in robot motion planning, in: Proc. 25th IEEE Internet. Conf. on Systems, Man and Cybernetics.
8. R.G. Downey, P.A. Evans, M.R. Fellows, Parameterized learning complexity, Proceedings of the Sixth ACM Workshop on Computational Learning Theory COLT'93, pp. 51-57.
9. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness I: basic theory, SIAM J. Comput. 24 (1995) 873-921.
10. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness II: completeness for W[1], Theoret. Comput. Sci. A 141 (1995) 109-131.
11. R.G. Downey, M.R. Fellows, Parameterized computational feasibility, Proceedings of the Second Cornell Workshop on Feasible Mathematics, Feasible Mathematics II, P. Clote and J. Remmel (eds.), Birkhauser Boston (1995) 219-244.
12. R.G. Downey, M.R. Fellows, M.T. Hallett, B.M. Kapron, H.T. Wareham, The parameterized complexity of some problems in logic and linguistics, Proc. Symp. on Logical Foundations of Computer Science (LFCS), Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994, pp. 89-100.
13. R.G. Downey, M. Fellows, K. Regan, Parameterized circuit complexity and the W hierarchy, Theoret. Comput. Sci. A, to appear.
14. R.G. Downey, M.R. Fellows, U. Taylor, The complexity of relational database queries and an improved characterization of W[1], in: Proc. DMTCS 96, Lecture Notes in Computer Science, Springer, 1996, to appear.
15. M.R. Fellows, N. Koblitz, Fixed-parameter complexity and cryptography, Proc. 10th Internat. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC'93), Lecture Notes in Computer Science, vol. 673, Springer, Berlin, 1993, pp. 121-131.
16. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, 1979.