Pages that link to "Item:Q5129229"
From MaRDI portal
The following pages link to Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229):
Displaying 7 items.
- The complexity of approximating the complex-valued Potts model (Q2125077) (← 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 Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- Absence of zeros implies strong spatial mixing (Q6045833) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial (Q6198132) (← links)
- On the zeroes of hypergraph independence polynomials (Q6632793) (← links)
