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...
Main Authors: | Galanis, A, Stefankovic, D, Vigoda, E |
---|---|
格式: | Journal article |
出版: |
Association for Computing Machinery
2015
|
相似书籍
-
Inapproximability of the partition function for the antiferromagnetic ising and hard-core models
由: Galanis, A, et al.
出版: (2016) -
Inapproximability of the independent set polynomial below the Shearer threshold
由: Galanis, A, et al.
出版: (2017) -
Inapproximability of the independent set polynomial in the complex plane
由: Bezáková, I, et al.
出版: (2020) -
Inapproximability of the independent set polynomial in the complex plane
由: Bezakova, I, et al.
出版: (2018) -
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
由: Goldberg, L, et al.
出版: (2015)