The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Allan Sly
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region