ACM Symposium on Discrete Algorithms, SODA 2016


Article Details
Title: The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
Article URLs:
Alternative Article URLs:
Authors: Andreas Galanis
  • University of Oxford, Wolfson Building, Parks Road, Oxford, Department of Computer Science
Leslie Ann Goldberg
  • University of Oxford, Wolfson Building, Parks Road, Oxford, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/GalanisG16
Author Comments:

Discuss this paper and its artifacts below