A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Approximability of the Ground State Problem for Certain Ising Spin Glasses
1997
Journal of Complexity
We consider polynomial time algorithms for finding approximate solutions to the ground state problem for the following three-dimensional case of an Ising spin glass: 2n spins are arranged on a two-level grid with at most n γ vertical interactions (0 ≤ γ ≤ 1). The main results are: 1. Let 1 2 ≤ γ < 1. There is an approximate polynomial time algorithm with absolute error less than n γ for all n; there exists a constant β > 0 such that every approximate polynomial time algorithm has absolute error
doi:10.1006/jcom.1997.0449
fatcat:ghrd2c2ufzbufpkicsfwzaymle