The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs.

Allan Sly, Nike Sun

Browse the full FOCS paper archive.