The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs (Q4575611)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs |
scientific article; zbMATH DE number 6903911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs |
scientific article; zbMATH DE number 6903911 |
Statements
The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs (English)
0 references
16 July 2018
0 references
