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

Allan Sly, Nike Sun (2012)

Details and statistics

DOI: 10.1109/FOCS.2012.56

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.