Parameterized circuit complexity and the W hierarchy

Theoretical Computer Science

Volumn 191, Issue 1-2, 1998, Pages 97-115

  Downey, Rodney G ^a   Fellows, Michael R ^b   Regan, Kenneth W ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

^c the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003500262     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00317-9     Document Type: Article

References (18)

1. K.A. Abrahamson, R.G. Downey and 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, M.R. Fellows and M. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, in: Proc. ACM Symp. on the Theory Computing (STOC) (1994) 449-458.
3. R. Boppana and M. Sipser, The complexity of finite functions, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier and MIT Press, Amsterdam, New York, 1990) 757-804.
4. M. Cesati and M. Fellows, Sparse parameterized problems, Ann. Pure Appl. Logic 62 (1996).
5. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetical progressions, J. Symbolic Comput. 9 (1990) 251-280.
6. R.R. Downey and M.R. Fellows, Fixed parameter tractability and completeness III: some structural aspects of the W hierarchy, in: K. Ambos-Spies, S. Homer and U. Schöning, eds., Proc. Dagstuhl Workshop on Structural Complexity, Complexity Theory: Current Research (Cambridge Univ. Press, Cambridge, 1993) 191-226.
7. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness I: basic theory, SIAM J. Comput. 24 (1995) 873-921.
8. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness II: completeness for W[1], Theoret. Comput. Sci. A 141 (1995) 109-131.
9. R.G. Downey and M.R. Fellows, Parameterized computational feasibility, in: P. Clote and J. Remmel, eds., Proc. 2nd Cornell Workshop on Feasible Mathematics, Feasible Mathematics II (Birkhauser, Boston, 1995) 219-244.
10. R.G. Downey, M.R. Fellows, M.T. Hallett, B.M. Kapron and H.T. Wareham, The parameterized complexity of some problems in logic and linguistics, in: Proc. Symp. Logical Foundations of Computer Science (LFCS), Lecture Notes in Computer Science, Vol. 813 (Springer, Berlin, 1994) 89-100.
11. M.R. Fellows and N. Koblitz, Fixed-parameter complexity and cryptography, in: 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) 121-131.
12. M. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979).
13. J. Köbler, U. Schöning and J. Torán, The Graph Isomorphism Problem: Its Structural Complexity (Birkhäuser, Basel, 1993).
14. J. Nesetril and S. Poljak, On the complexity of the subgraph problem, Commen. Math. Univ. Carol. 26 (1985) 415-419.
15. K. Regan, Finitary substructure languages, in: Proc. 4th Ann. IEEE Conf. on Structure in Complexity Theory (1989) 87-96.
16. M. Sipser, Borel sets and circuit complexity, in: Proc. 15th ACM Symp. on the Theory of Computing (1983) 61-69.
17. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput. (1991) 865-877.
18. L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoret. Comput. Sci. 47 (1986) 85-93.