Pages that link to "Item:Q5866450"
From MaRDI portal
The following pages link to The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450):
Displaying 4 items.
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- A near-optimal zero-free disk for the Ising model (Q6615526) (← links)