Pages that link to "Item:Q5065635"
From MaRDI portal
The following pages link to The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635):
Displaying 6 items.
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- The complexity of approximating the matching polynomial in the complex plane (Q5091171) (← links)
- Inapproximability of the independent set polynomial in the complex plane (Q5230376) (← links)
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- On the zeroes of hypergraph independence polynomials (Q6632793) (← links)