The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
From MaRDI portal
Recommendations
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- The complexity of approximating complex-valued Ising and Tutte partition functions
- The complexity of approximating the complex-valued Potts model
- The Ising partition function: zeros and deterministic approximation
Cites work
- An introduction to Riemann surfaces
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Beitrag zur Theorie des Ferromagnetismus
- Cayley trees do not determine the maximal zero-free locus of the independence polynomial
- Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems
- Combinatorics and complexity of partition functions
- Computing in the field of complex algebraic numbers
- Counting independent sets up to the tree threshold
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Dynamics in One Complex Variable. (AM-160)
- Fisher Zeros and Correlation Decay in the Ising Model
- Holant problems for 3-regular graphs with complex edge functions
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 51680 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- Inapproximability of the independent set polynomial in the complex plane
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- Matchings and walks in graphs
- More on zeros and approximation of the Ising partition function
- On a conjecture of Sokal concerning roots of the independence polynomial
- On the computational complexity of the Jones and Tutte polynomials
- Polynomial-Time Approximation Algorithms for the Ising Model
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- STATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISM
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- The complexity of approximating complex-valued Ising and Tutte partition functions
- The complexity of approximating the complex-valued Potts model
- The Complexity of Approximating the Matching Polynomial in the Complex Plane
- The complexity of computing the sign of the Tutte polynomial
- The Ising partition function: zeros and deterministic approximation
- The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
- Theory of monomer-dimer systems
- Weighted counting of solutions to sparse systems of equations
- Zeros of ferromagnetic 2-spin systems
- Zeros of Holant problems: locations and algorithms
Cited in
(8)- The complexity of approximating the complex-valued Potts model
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- The complexity of approximating the complex-valued Potts model
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Approximating the chromatic polynomial is as hard as computing it exactly
- Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- The complexity of approximating the complex-valued Ising model on bounded degree graphs
- A near-optimal zero-free disk for the Ising model
This page was built for publication: The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866450)
