Pages that link to "Item:Q1686832"
From MaRDI portal
The following pages link to The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832):
Displayed 9 items.
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Location of zeros for the partition function of the Ising model on bounded degree graphs (Q3296755) (← links)
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
- The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
- (Q5092422) (← links)
- Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
- Efficient algorithms for approximating quantum partition functions (Q5855662) (← 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)