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

類似資料