Parameterized Counting Problems
Parameterized complexity has, so far, been largely confined to consideration of computational problems as decision or search problems. However, it is becoming evident that the parameterized point of view can lead to new insight into counting problems. The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems.
KeywordsTuring Machine Vertex Cover Boolean Expression Satisfying Assignment Perfect Code
Unable to display preview. Download preview PDF.
- 1.A. Andrzejak: An algorithm for the Tutte Polynomials of Graphs of Bounded Treewidth. Discrete Math. 190, pp 39–54, (1998).Google Scholar
- 2.V. Arvind and V. Raman: Approximate Counting Small Subgraphs of Bounded Treewidth and Related Problems. manuscript.Google Scholar
- 3.C. Bazgan: Schémas d’approximation et complexité paramétrée. Rapport de stage de DEA d’Informatique à Orsay, (1995).Google Scholar
- 9.R. G. Downey and M. R. Fellows: Parameterized Complexity. Springer-Verlag (1999).Google Scholar
- 10.Markus Frick Easy Instances for Model-Checking. Ph.D. Thesis, Laboratory for Foundations of Computer Science, The University of Edinburgh, (2001).Google Scholar
- 12.M. Grohe: personal communication.Google Scholar
- 13.D. Kozen: The Design and Analysis of Algorithms. Springer-Verlag (1991).Google Scholar
- 14.J.A. Makowsky: Colored Tutte Polynomials and Kauffman Brackets for Graphs of Bounded Tree Width. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, pp. 487–495, (2001).Google Scholar
- 16.C. H. Papdimitriou: Computational Complexity. Addison Wesley (1994).Google Scholar
- 17.A. Razborov and M. Alekhnovich: Resolution is Not Automatizable Unless W[P] is Tractable. Proc. of the 42nd IEEE FOCS, pp 210–219, (2001).Google Scholar
- 19.D. Welsh and A. Gale: The Complexity of Counting Problems. Aspects of Complexity, editors R. Downey and D. Hirschfeldt, de Gruyter Series in Logic and Its Applications, pp 115–154, (2001).Google Scholar