Approximability of the ground state problem for certain Ising spin glasses

DOI10.1006/jcom.1997.0449zbMath1017.82011OpenAlexW2081853388MaRDI QIDQ1296524

Alberto Bertoni, Paola Campadelli, Cristina Gangai, Roberto Posenato

Publication date: 29 November 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1997.0449

zbMATH Keywords

approximate solutionspolynomial time algorithmsIsing spin glassground state problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Preface, A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses