The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450)
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 Approximating the Complex-Valued Ising Model on Bounded Degree Graphs |
scientific article; zbMATH DE number 7589619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs |
scientific article; zbMATH DE number 7589619 |
Statements
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (English)
0 references
21 September 2022
0 references
Ising model
0 references
approximate counting
0 references
bounded degree graphs
0 references
partition function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8644430637359619
0 references
0.8569169044494629
0 references
0.8405430316925049
0 references
0.8315976858139038
0 references
0.8300759196281433
0 references
