Parameterized counting problems

Annals of Pure and Applied Logic

Volumn 138, Issue 1-3, 2006, Pages 147-182

  McCartin, Catherine ^a  

^a MASSEY UNIVERSITY   (New Zealand)

Author keywords

Complexity; Counting problems; Parameterized complexity; Parameterized counting problems

Indexed keywords

EID: 33644812040     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.06.010     Document Type: Article

References (23)

1. A. Andrzejak An algorithm for the Tutte polynomials of graphs of bounded treewidth Discrete Math. 190 1998 39-54
2. V. Arvind, V. Raman, Approximate counting small subgraphs of bounded treewidth and related problems, ECCC Report TR02-031, 2002
3. R. Balasubramanian, R. Downey, M. Fellows, V. Raman, Unpublished manuscript
4. C. Bazgan, Schémas d'approximation et complexité paramétrée, Rapport de stage de DEA d'Informatique à Orsay, 1995
5. M. Cesati Perfect code is W[1]-complete Inform. Process. Lett. 81 3 2002 163-168
6. M. Cesati, The Turing way to the parameterized intractability, Manuscript
7. M. Cesati L. Trevisan On the efficiency of polynomial time approximation schemes Inform. Process. Lett. 64 4 1997 165-171
8. J. Chen I.A. Kanj W. Jia Vertex cover: Further observations and further improvements J. Algorithms 41 2001 280-301
9. B. Courcelle J.A. Makowsky U. Rotics On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic Discrete Appl. Math. 108 1-2 2001 23-52
10. R.G. Downey M.R. Fellows Fixed-parameter tractability and completeness Congr. Numer. 87 1992 161-187
11. R.G. Downey M.R. Fellows Parameterized Complexity 1999 Springer-Verlag
12. M. Frick, Easy instances for model-checking, Ph.D. Thesis, June 2001, Laboratory for Foundations of Computer Science, The University of Edinburgh, 2001
13. M. Frick M. Grohe Deciding first-order properties of locally tree-decomposable graphs Proceedings of the 26th International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science vol. 1644 1999 Springer-Verlag 331-340
14. M. Garey D. Johnson Computers and Intractability, A Guide to the Theory of NP-completeness 1979 W.H. Freeman and Company
15. M. Grohe, Personal communication
16. D. Kozen The Design and Analysis of Algorithms 1991 Springer-Verlag
17. J.A. Makowsky, Colored tutte polynomials and kauffman brackets for graphs of bounded tree width, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, 2001, pp. 487-495
18. S.D. Noble Evaluating the Tutte polynomial for graphs of bounded tree-width Combin. Probab. Comput. 7 1998 307-321
19. C.H. Papdimitriou Computational Complexity 1994 Addison Wesley
20. V. Raman, Presentation at Dagstuhl Seminar on Parameterized Complexity, Dagstuhl, Germany, July 29-August 3, 2001
21. A. Razborov, M. Alekhnovich, Resolution is not automatizable unless W[P] is tractable, in: Proc. of the 42nd IEEE FOCS, 2001, pp. 210-219
22. L. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 1979 189-201
23. D. Welsh A. Gale The complexity of counting problems R. Downey D. Hirschfeldt Aspects of Complexity de Gruyter Series in Logic and Its Applications 2001 115-154