The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6654479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs |
scientific article; zbMATH DE number 6654479 |
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
0 references
0 references
0 references
0 references
0.9936773180961608
0 references
0.8272891044616699
0 references
0.8130323886871338
0 references
0.8087382912635803
0 references
0.8086982369422913
0 references
