Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
<p style="text-align:justify;"> A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree Δ undergoes a...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
Association for Computing Machinery
2015
|