Approximability of the ground state problem for certain Ising spin glasses
DOI10.1006/JCOM.1997.0449zbMATH Open1017.82011OpenAlexW2081853388MaRDI QIDQ1296524FDOQ1296524
Authors: 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
Recommendations
- On the approximability of the `ground-state' problem for Ising spin glasses by quantum devices
- Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
- Polynomial-Time Approximation Algorithms for the Ising Model
- scientific article
Analysis of algorithms (68W40) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cited In (11)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses
- More about NP-completeness in the frustration model of spin-glasses
- On the approximability of the `ground-state' problem for Ising spin glasses by quantum devices
- Computational thresholds for the fixed-magnetization Ising model
- Optimal sufficient requirements on the embedded Ising problem in polynomial time
- Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- On the strict inequality between quenched and annealed Ising spin glass
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
- Preface
This page was built for publication: Approximability of the ground state problem for certain Ising spin glasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296524)
