Complexity of ising polynomials

Combinatorics Probability and Computing

Volumn 21, Issue 5, 2012, Pages 743-772

  Kotek, Tomer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; BIVARIATE POLYNOMIALS; CLIQUE-WIDTH; CONSTANT ENERGY; DICHOTOMY THEOREM; EDGE WEIGHTS; EXPONENTIAL TIME; EXPONENTIAL TIME HYPOTHESIS; EXTERNAL FIELDS; ISING SYSTEMS; PARTITION FUNCTIONS; PHYSICAL SYSTEMS; POLYNOMIAL-TIME; TRIVARIATE; TUTTE POLYNOMIAL;

FUNCTION EVALUATION; ISING MODEL; POLYNOMIAL APPROXIMATION; STATISTICAL MECHANICS; THEOREM PROVING;

GRAPH THEORY;

EID: 84864754600     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548312000259     Document Type: Article

References (32)

1. Andrén, D. and Markström, K. (2009) The bivariate Ising polynomial of a graph. Discrete Appl. Math. 157 2515-2524.
2. Andrzejak, A. (1998) An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Math. 190 39-54.
3. Bulatov, A. A. and Grohe, M. (2005) The complexity of partition functions. Theoret. Comput. Sci. 348 148-186.
4. Cai, J., Chen, X. and Lu, P. (2010) Graph homomorphisms with complex values: A dichotomy theorem. In ICALP 1 (S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, eds), Vol. 6198 of Lecture Notes in Computer Science, Springer, pp. 275-286.
5. Courcelle, B. and Olariu, S. (2000) Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 77-114.
6. Dell, H., Husfeldt, T. and Wahlen, M. (2010) Exponential time complexity of the permanent and the Tutte polynomial. In ICALP 1 (S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, eds), Vol. 6198 of Lecture Notes in Computer Science, Springer, pp. 426-437.
7. Dyer, M. and Greenhill, C. (2000) The complexity of counting graph homomorphisms. Random Struct. Alg. 17 260-289.
8. Vertigan, D. L. Jaeger, F. and Welsh, D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Phil. Soc. 108 35-53.
9. Fisher, M. E. (1966) On the dimer solution of planar Ising models. J. Math. Phys. 7 1776-1781.
10. Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
11. Fomin, F. V., Golovach, P. A., Lokshtanov, D. and Saurabh, S. (2010) Algorithmic lower bounds for problems parameterized with clique-width. In SODA (M. Charikar, ed.), SIAM, pp. 493-502.
12. Giménez, O., Hlinený, P. and Noy, M. (2006) Computing the Tutte polynomial on graphs of bounded clique-width. SIAM J. Discrete Math. 20 932-946.
13. Goldberg, L. A., Grohe, M., Jerrum, M. and Thurley, M. (2010) A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput. 39 3336-3402.
14. Goldberg, L. A., Jerrum, M. and Paterson, M. (2003) The computational complexity of two-state spin systems. Random Struct. Alg. 23 133-154.
15. Graham, R. L., Knuth, D. E. and Patashnik, O. (1994) Concrete Mathematics, second edition. Addison-Wesley.
16. Impagliazzo, R. and Paturi, R. (1999) Complexity of k-SAT. In Proc. 14th Annual IEEE Conference on Computational Complexity: CCC-99, IEEE Computer Society Press, pp. 237-240.
17. Jerrum, M. and Sinclair, A. (1993) Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22 1087-1116.
18. Kasteleyn, P. W. (1967) Graph theory and crystal physics. In Graph Theory and Theoretical Physics (F. Harary, ed.), Academic Press, pp. 43-110.
19. Makowsky, J. A. (2004) Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Logic 126 159-213.
20. Makowsky, J. A., Rotics, U., Averbouch, I. and Godlin, B. (2006) Computing graph polynomials on graphs of bounded clique-width. In WG 2006 (F. V. Fomin, ed.), Vol. 4271 of Lecture Notes in Computer Science, Springer, pp. 191-204.
21. Noble, S. D. (1998) Evaluating the Tutte polynomial for graphs of bounded tree-width. In Combin. Probab. Comput. 7 307-321.
22. Noble, S. D. (2009) Evaluating a weighted graph polynomial for graphs of bounded tree-width. Electron. J. Combin. 16 R64.
23. Oum, S. (2005) Approximating rank-width and clique-width quickly. In WG 2005 (D. Kratsch, ed.), Vol. 3787 of Lecture Notes in Computer Science, Springer, pp. 49-58.
24. Oum, S. and Seymour, P. (2006) Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 514-528.
25. Sinclair, A., Srivastava, P. and Thurley, M. (2011) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. In SODA (Y. Rabani, ed.), SIAM, pp. 941-953.
26. Sokal, A. D. (2005) The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in Combinatorics (B. S. Webb, ed.), Vol. 327 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 173-226.
27. Thurley, M. The Complexity of Partition Functions. PhD thesis, Humboldt Universität zu Berlin.
28. van der Waerden, B. L. (1941) Die lange Reichweite der regelmässigen Atomanordnung in Mischkristallen. Z. Physik 118 573-479.
29. Vertigan, D. (2006) The computational complexity of Tutte invariants for planar graphs. SIAM J. Comput. 35 690-712.
30. Vertigan, D. and Welsh, D. J. A. (1992) The computational complexity of the Tutte plane: The bipartite case. Combin. Probab. Comput. 1 181-187.
31. Xia, M., Zhang, P. and Zhao, W. (2007) Computational complexity of counting problems on 3-regular planar graphs. Theoret. Comput. Sci. 384 111-125.
32. Zhang, J., Liang, H. and Bai, F. (2011) Approximating partition functions of the two-state spin system. Inform. Process. Lett. 111 702-710.