The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-call...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2016
|