Computer-Intractability of the Frustration Model of a Spin Glass
Journal of Physics A: Mathematical and General 17 (13): L709 (1984)

The author proves that finding a ground state of the three-dimensional frustration model of a spin glass is an NP-complete optimisation problem, and hence probably intractable in the sense that no algorithm requiring a time bounded by a polynomial of the volume can exactly solve it.
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).