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...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों:	Goldberg, L, Galanis, A
स्वरूप:	Journal article
प्रकाशित:	Elsevier 2016

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs द्वारा Goldberg, L, Galanis, A

प्रकाशित 2016

Journal article

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs द्वारा Galanis, A, Goldberg, L

प्रकाशित 2015

Conference item

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs द्वारा Goldberg, L, Galanis, A

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs द्वारा Galanis, A, Goldberg, L

समान संसाधन