Polynomial-Time Approximation Algorithms for the Ising Model
- 1 October 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (5) , 1087-1116
- https://doi.org/10.1137/0222066
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Structural Complexity IPublished by Springer Nature ,1988
- An Introduction to the Ising ModelThe American Mathematical Monthly, 1987
- Eigenvalues and expandersCombinatorica, 1986
- Difference equations, isoperimetric inequality and transience of certain random walksTransactions of the American Mathematical Society, 1984
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- On the Dimer Solution of Planar Ising ModelsJournal of Mathematical Physics, 1966
- Beitrag zur Theorie des FerromagnetismusZeitschrift für Physik, 1925