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: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Cambridge University Press
2016
|