Pages that link to "Item:Q5028870"

The following pages link to Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870):

Displaying 9 items.

• On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
• Spectral bounds for the Ising ferromagnet on an arbitrary given graph (Q3303065) (← links)
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← 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)
• Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial (Q6198132) (← links)
• Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q6343793) (← links)
• A near-optimal zero-free disk for the Ising model (Q6615526) (← links)
• On the zeroes of hypergraph independence polynomials (Q6632793) (← links)