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...
主要な著者: | 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, 等
出版事項: (2016) -
Inapproximability of the independent set polynomial below the Shearer threshold
著者:: Galanis, A, 等
出版事項: (2017) -
Inapproximability of the independent set polynomial in the complex plane
著者:: Bezáková, I, 等
出版事項: (2020) -
Inapproximability of the independent set polynomial in the complex plane
著者:: Bezakova, I, 等
出版事項: (2018) -
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
著者:: Goldberg, L, 等
出版事項: (2015)