The computational hardness of counting in two-spin models on d-regular graphs

Allan Sly, Nike Sun

Research output: Contribution to journal › Conference article › peer-review

84 Scopus citations

Fingerprint

Dive into the research topics of 'The computational hardness of counting in two-spin models on d-regular graphs'. Together they form a unique fingerprint.

Engineering & Materials Science