Inapproximability of the partition function for the antiferromagnetic ising and hard-core models
<p style="text-align:justify;"> Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006), establish a beautiful picture of the computational complexity of approximating the partition function of the hard-core model. Let λc(TΔ...
Main Authors: | Galanis, A, Stefankovic, D, Vigoda, E |
---|---|
Formato: | Journal article |
Publicado: |
Cambridge University Press
2016
|
Títulos similares
-
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
por: Galanis, A, et al.
Publicado: (2015) -
Inapproximability of the independent set polynomial below the Shearer threshold
por: Galanis, A, et al.
Publicado: (2017) -
Inapproximability of the independent set polynomial in the complex plane
por: Bezáková, I, et al.
Publicado: (2020) -
Inapproximability of the independent set polynomial in the complex plane
por: Bezakova, I, et al.
Publicado: (2018) -
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
por: Galanis, A, et al.
Publicado: (2016)