\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470)
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: \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region |
scientific article; zbMATH DE number 6570307
| 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 6570307 |
Statements
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (English)
0 references
18 April 2016
0 references
spin systems
0 references
approximate counting
0 references
complexity
0 references
\(\#\)BIS-hardness
0 references
phase transition
0 references
0 references
0 references
0 references
0.978149116039276
0 references
0.8564121723175049
0 references
0.855135440826416
0 references
0.8497340083122253
0 references
