\#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q2969647)
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 6696530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region |
scientific article; zbMATH DE number 6696530 |
Statements
22 March 2017
0 references
spin systems
0 references
approximate counting
0 references
complexity
0 references
\#BIS-hardness
0 references
phase transition
0 references
0.978149116039276
0 references
0.8634140491485596
0 references
0.8632282614707947
0 references
0.8617788553237915
0 references
0.8589648604393005
0 references
