The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs |
scientific article |
Statements
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (English)
0 references
18 November 2016
0 references
approximate counting
0 references
bounded-degree hypergraphs
0 references
2-spin systems
0 references
counting constraint satisfaction
0 references
