论文信息 - Computer-intractability of the frustration model of a spin glass

Computer-intractability of the frustration model of a spin glass

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.

C. Bachas

[1] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.

[2] L. Bieche,et al. On the ground states of the frustration model of a spin glass by a matching method of graph theory , 1980 .

[3] F. Barahona. On the computational complexity of Ising spin glass models , 1982 .

[4] F. Barahona,et al. Morphology of ground states of two-dimensional frustration model , 1982 .

[5] M. Mézard,et al. Replica symmetry breaking and the nature of the spin glass phase , 1984 .

[6] M. Mézard,et al. Nature of the Spin-Glass Phase , 1984 .