The parameterized complexity of counting problems

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 892-922

  Flum, Jörg ^a   Grohe, Martin ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Counting complexity; Descriptive complexity; Parameterized complexity; Paths and cycles

Indexed keywords

ALGORITHMS; FORMAL LOGIC; GRAPH THEORY; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY; TURING MACHINES;

COUNTING COMPLEXITY; DESCRIPTIVE COMPLEXITY; PARAMETERIZED COMPLEXITY; PATHS AND CYCLES;

COMPUTATIONAL COMPLEXITY;

EID: 4544242894     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703427203     Document Type: Article

References (29)

1. 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 (1995), pp. 235-276.
2. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, J. ACM, 42 (1995), pp. 844-856.
3. N. ALON, R. YUSTER, AND U. ZWICK, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209-223.
4. S. ARNBORG, J. LAGERGREN, AND D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), pp. 308-340.
5. V. ARVIND AND V. RAMAN, Approximation algorithms for some parameterized counting problems, in Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 2518, P. Bose and P. Morin, eds., Springer-Verlag, Berlin, 2002, pp. 453-464.
6. H. L. BODLAENDER, R. G. DOWNEY, M. R. FELLOWS, M. T. HALLETT, AND H. T. WAREHAM, Parameterized complexity analysis in computational biology, CABIOS, 11 (1995), pp. 49-57.
7. L. CAI AND J. CHEN, On fixed-parameter tractability and approximability of NP optimization problems, J. Comput. System Sci., 54 (1997), pp. 465-474.
8. Y. CHEN, J. FLUM, AND M. GROHE, Bounded nondeterminism and alternation in parameterized complexity theory, in Proceedings of the 18th IEEE Conference on Computational Complexity, 2003, pp. 13-29.
9. B. COURCELLE, Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 193-242.
10. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, On the fixed-parameter complexity of graph enumeration problems definable in monadic second-order logic, Discrete Appl. Math., 108 (2001), pp. 23-52.
11. R. G. DOWNEY AND M. R. FELLOWS, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput., 24 (1995), pp. 873-921.
12. R. G. DOWNEY AND M. R. FELLOWS, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoret. Comput. Sci., 141 (1995), pp. 109-131.
13. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
14. R. G. DOWNEY, M. R. FELLOWS, AND K. W. REGAN, Descriptive complexity and the W hierarchy, in Proof Complexity and Feasible Arithmetics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 39, P. Beame and S. Buss, eds., AMS, Providence, RI, 1998, pp. 119-134.
15. J. FLUM AND M. GROHE, Fixed-parameter tractability, definability, and model-checking, SIAM J. Comput., 31 (2001), pp. 113-145.
16. M. FRICK, Generalized model-checking over locally tree-decomposable classes, in Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2285, H. Alt and A. Ferreira, eds., Springer-Verlag, New York, 2002, pp. 632-644.
17. M. FRICK AND M. GROHE, Deciding first-order properties of locally tree-decomposable structures, J. ACM, 48 (2001), pp. 1184-1206.
18. G. GOTTLOB, N. LEONE, AND M. SIDERI, Fixed-parameter complexity in AI and nonmonotonic reasoning, in Logic Programming and Nonmonotonic Reasoning, 5th International Conference, LPNMR'99, Lecture Notes in Comput. Sci. 1730, M. Gelfond, N. Leone, and G. Pfeifer, eds., Springer-Verlag, Berlin, 1999, pp. 1-18.
19. M. GROHE, The parameterized complexity of database queries, in Proceedings of the 20th ACM Symposium on Principles of Database Systems, 2001, ACM Press, New York, pp. 82-92.
20. M. JERRUM, A. SINCLAIR, AND E. VIGODA, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, in Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, ACM Press, New York, pp. 712-721.
21. PH. G. KOLAITIS AND M. N. THAKUR, Approximation properties of NP minimization classes, J. Comput. System Sci., 50 (1995), pp. 391-411.
22. 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, ACM, New York, SIAM, Philadelphia, 2001, pp. 487-495.
23. C. MCCARTIN, Parameterized counting problems, in Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 2420, K. Diks and W. Rytter, eds., Springer-Verlag, Heidelberg, 2002, pp. 556-567.
24. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On the complexity of database queries, in Proceedings of the 17th ACM Symposium on Principles of Database Systems, 1997, ACM Press, New York, pp. 12-19.
25. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
26. J. PLEHN AND B. VOIGT, Finding minimally weighted subgraphs, in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 484, R. Möhring, ed., Springer-Verlag, Berlin, 1991, pp. 18-29.
27. U. STEGE, Resolving Conflicts in Problems from Computational Biology, Ph.D. thesis 13364, ETH Zürich, Zürich, Switzerland, 2000.
28. S. TODA, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput., 20 (1991), pp. 865-877.
29. L. G. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.