A complexity dichotomy for partition functions with mixed signs

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 493-504

  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

Indexed keywords

COMPLEXITY DICHOTOMIES; DICHOTOMY THEOREM; INDEPENDENT SET; PARTITION FUNCTIONS; POLYNOMIAL-TIME; QUADRATIC POLYNOMIAL; STATISTICAL PHYSICS; SYMMETRIC MATRICES;

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; HADAMARD MATRICES; ISING MODEL;

POLYNOMIAL APPROXIMATION;

EID: 79959981578     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. L. Barto, M. Kozik, and T. Niven. Graphs, polymorphisms and the complexity of homomorphism problems. In Proceedings of the 40th ACM Symposium on Theory of Computing, 2008. To appear.
2. Markus Bläser and Holger Dell. Complexity of the cover polynomial. In L. Arge, Ch. Cachin, T. Jurdzinski, and A. Tarlecki, editors, of the 34th International Colloquium on Automata, Languages and Programming, volume 4596 of Lecture Notes in Computer Science, pages 801-812. Springer Verlag, 2007.
3. A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM, 53:66-120, 2006.
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 Computer Science. Springer Verlag, 2008. To appear.
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, pages 562-571, 2003.
6. A. Bulatov and M. Grohe. The complexity of partition functions. Theoretical Computer Science, 348:148-186, 2005.
7. M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures and Algorithms, 17(3-4):260-289, 2000.
8. M.E. Dyer, L.A. Goldberg, and M. Paterson. On counting homomorphisms to directed acyclic graphs. Journal of the ACM, 54(6), 2007.
9. Andrzej Ehrenfeucht and Marek Karpinski. The computational complexity of (xor, and)-counting problems. Technical Report 8543-CS, 1990. Available at http://citeseer.ist.psu.edu/ehrenfeucht90computational.html.
10. M. Freedman, L. Lovász, and A. Schrijver. Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society, 20:37-51, 2007.
11. 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, pages 53-62, 2002.
12. L.A. Goldberg and M. Jerrum. Inapproximability of the tutte polynomial. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 459-468, 2007.
13. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
14. 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:35-53, 1990.
15. Rudolf Lidl and Harald Niederreiter. Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2nd edition, 1997.
16. M. Lotz and J.A. Makowsky. On the algebraic complexity of some families of coloured tutte polynomials. Advances in Applied Mathematics, 32:327-349, 2004.
17. L. Lovász. The rank of connection matrices and the dimension of graph algebras. European Journal of Combinatorics, 27:962-970, 2006.
18. L. Lovász and A. Schrijver. Graph parameters and semigroup functions. European Journal of Combinatorics. To appear.
19. Alan Sokal. The multivariate Tutte polynomial. In Surveys in Combinatorics. Cambridge University Press, 2005.
20. D. J. A. Welsh. Complexity: Knots, Colourings and Counting, volume 186 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1993.