Pages that link to "Item:Q5866450"

The following pages link to The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450):

Displaying 2 items.

• 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)