Pages that link to "Item:Q2125077"
From MaRDI portal
The following pages link to The complexity of approximating the complex-valued Potts model (Q2125077):
Displaying 5 items.
- Approximating the Partition Function of the Ferromagnetic Potts Model (Q3587394) (← links)
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- The complexity of approximating the complex-valued Potts model (Q6339918) (← links)
- On the zeroes of hypergraph independence polynomials (Q6632793) (← links)