A complexity dichotomy for partition functions with mixed signs

SIAM Journal on Computing

Volumn 39, Issue 7, 2010, Pages 3336-3402

  Goldberg, Leslie Ann ^a   Grohe, Martin ^b   Jerrum, Mark ^c   Thurley, Marc ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b HUMBOLDT UNIVERSITY   (Germany)

^c QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Computational complexity; Counting complexity; Graph homomorphisms; Partition functions

Indexed keywords

COMPLEXITY DICHOTOMIES; COUNTING COMPLEXITY; DICHOTOMY THEOREM; GRAPH HOMOMORPHISMS; GRAPH INVARIANT; GREENHILL; HADAMARD MATRICES; INDEPENDENT SET; MATRIX; P-COMPLETE; PARTITION FUNCTIONS; POLYNOMIAL-TIME; QUADRATIC POLYNOMIAL; RANDOM STRUCTURES; STATISTICAL PHYSICS; SYMMETRIC MATRICES;

ALGEBRA; COMPUTATIONAL COMPLEXITY; ISING MODEL; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; SPIN GLASS;

NUMBER THEORY;

EID: 77956024136     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090757496     Document Type: Article

References (24)

1. L. BARTO, M. KOZIK, AND T. NIVEN, Graphs, polymorphisms and the complexity of homomorphism problems, in STOC '08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, ACM, New York, 2008, pp. 789-796.
2. M. BLÄSER AND H. DELL, Complexity of the cover polynomial, in Proceedings of the 34th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 4596, L. Arge, Ch. Cachin, T. Jurdzinski, and A. Tarlecki, eds., Springer-Verlag, New York, 2007, pp. 801-812.
3. A. BULATOV, A dichotomy theorem for constraint satisfaction problems on a 3-element set, J. ACM, 53 (2006), pp. 66-120.
4. A. BULATOV, The complexity of the counting constraint satisfaction problem, in Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 5125, Springer-Verlag, New York, 2008, pp. 646-661.
5. A. BULATOV AND V. DALMAU, Towards a dichotomy theorem for the counting constraint satisfaction problem, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, 2003, pp. 562-571.
6. A. BULATOV AND M. GROHE, The complexity of partition functions, Theoret. Comput. Sci., 348 (2005), pp. 148-186.
7. J.-Y. CAI, X. CHEN, AND P. Lu, Graph homomorphisms with complex values: A dichotomy theorem, in Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP '10), Lecture Notes in Comput. Sci. 6198, Springer-Verlag, New York, 2010, pp. 275-286.
8. M. DYER AND C. GREENHILL, The complexity of counting graph homomorphisms, Random Structures Algorithms, 17 (2000), pp. 260-289.
9. M. DYER, L. A. GOLDBERG, AND M. JERRUM, A complexity dichotomy for hypergraph partition functions, J. Computational Complexity, to appear.
10. M. DYER, L. A. GOLDBERG, AND M. PATERSON, On counting homomorphisms to directed acyclic graphs, J. ACM, 54 (2007), p. 27.
11. A. EHRENFEUCHT AND M. KARPINSKI, The Computational Complexity of (xor, and) - Counting Problems, Tech. Report 8543-CS, available at http://citeseer.ist.psu.edu/ehrenfeucht90computational.html, 1990.
12. M. FREEDMAN, L. LOVÁSZ, AND A. SCHRIJVER, Reflection positivity, rank connectivity, and homomorphism of graphs, J. Amer. Math. Soc, 20 (2007), pp. 37-51.
13. L. A. GOLDBERG, S. KELK, AND M. PATERSON, The complexity of choosing an H-colouring (nearly) uniformly at random, in Proceedings of the 34th ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 53-62.
14. L. A. GOLDBERG AND M. JERRUM, Inapproximability of the Tutte polynomial, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, ACM, New York, 2007, pp. 459-468.
15. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
16. F. JAEGER, D. L. VERTIGAN, AND D. J. A. WELSH, On the computational complexity of the Jones and Tutte polynomials, Mathematical Proceedings of the Cambridge Philosophical Society, 108 (1990), pp. 35-53.
17. R. E. LADNER, On the structure of polynomial time reducibility, J. ACM, 22 (1975), pp. 155-171.
18. R. LIDL AND H. NIEDERREITER, Finite Fields, 2nd ed., Encyclopedia Math. Appl. 20, Cambridge University Press, Cambridge, UK, 1997.
19. M. LOTZ AND J. A. MAKOWSKY, On the algebraic complexity of some families of coloured Tutte polynomials, Adv. in Appl. Math., 32 (2004), pp. 327-349.
20. L. LOVÁSZ, The rank of connection matrices and the dimension of graph algebras, European J. Combin., 27 (2006), pp. 962-970.
21. L. LOVÁSZ AND A. SCHRIJVER, Graph parameters and semigroup functions, European J. Combin., 29 (2008), pp. 987-1002.
22. A. SOKAL, The multivariate Tutte polynomial, in Surveys in Combinatorics, Cambridge University Press, Cambridge, UK, 2005, pp. 173-226.
23. M. THURLEY, The Complexity of Partition Functions, Ph.D. thesis, Humboldt-Universitat zu Berlin, Berlin, 2009.
24. D. J. A. WELSH, Complexity: Knots, Colourings and Counting, London Math. Soc. Lecture Note Ser. 186, Cambridge University Press, Cambridge, UK, 1993.