The complexity of partition functions

Theoretical Computer Science

Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 148-186

  Bulatov, Andrei ^a   Grohe, Martin ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Constraint satisfaction; Counting complexity; Graph homomorphism; Partition function

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

COUNTING COMPLEXITY; GRAPH HOMOMORPHISM; PARTITION FUNCTION;

FUNCTIONS;

EID: 33644514930     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.011     Document Type: Conference Paper

References (16)

1. A. Bulatov, and V. Dalmau Towards a dichotomy theorem for the counting constraint satisfaction problem Proc. 44th IEEE Symp. on Foundations of Computer Science, FOCS'03 2003 562 571
2. A.A. Bulatov A dichotomy theorem for constraints on a three-element set Proc. 43rd IEEE Symp. on Foundations of Computer Science, FOCS'02 2002 649 658
3. A.A. Bulatov Tractable conservative constraint satisfaction problems Proc. 18th Ann. IEEE Symp. on Logic in Computer Science 2003 321 330
4. N. Creignou, and M. Hermann Complexity of generalized satisfiability counting problems Inform. Comput. 125 1 1996 1 12
5. M. Dyer, and C. Greenhill The complexity of counting graph homomorphisms Random Struct. Algorithms 17 2000 260 289
6. M.E. Dyer, L.A. Goldberg, M. Jerrum, Counting and sampling H-colourings, in: J.D.P. Rolim, S.P. Vadhan (Eds.), Proc. sixth Int. Workshop on Randomization and Approximation Techniques, Lecture Notes in Computer Science, Vol. 2483, Springer, Berlin, 2002, pp. 51-67.
7. T. Feder, and M.Y. Vardi The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory SIAM J. Comput. 28 1998 57 104
8. L.A. Goldberg, M. Jerrum, and M. Paterson The computational complexity of two-state spin systems Random Struct. Algorithms 23 2003 133 154
9. L.A. Goldberg, S. Kelk, and M. Paterson The complexity of choosing an H-colouring (nearly) uniformly at random Proc. 34th ACM Symp. on Theory of Computing 2002 53 62
10. M. Grotschel, L. Lovasz, and A. Schrijver Geometric Algorithms and Combinatorial Optimization second ed. 1993 Springer Berlin
11. P. Hell, and J. Nešetřil On the complexity of H-coloring J. Combin. Theory Ser. B 48 1990 92 110
12. P. Hell, J. Nešetřil, and X. Zhu Duality and polynomial testing of tree homomorphisms Trans. AMS 348 4 1996 1281 1297
13. F. Jaeger, D.L. Vertigan, and D.J.A. Welsh On the computational complexity of the Jones and Tutte polynomials Math. Proc. Cambridge Philos. Soc. 108 1990 35 53
14. P.G. Jeavons, D.A. Cohen, and M. Gyssens Closure properties of constraints J. ACM 44 4 1997 527 548
15. K. Ko Complexity Theory of Real Functions 1991 Birkhäuser Basel
16. T.J. Schaefer The complexity of satisfiability problems Proc. 10th ACM Symp. on Theory of Computing 1978 216 226