The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
On the computational complexity of Ising spin glass models
Open accessAbstract
In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied. In a finite two-dimensional lattice these problems can be solved by algorithms that require a number of steps bounded by a polynomial function of the size of the lattice. In contrast to this fact, the same problems are shown to belong to the class of NP-hard problems, both in the two-dimensional case within a magnetic field, and in the three-dimensional case. NP-hardness of a problem suggests that it is very unlikely that a polynomial algorithm could exist to solve it.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Harary, F. (1969) · Cited by 10,739
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
Onsager, L. (1944) · Physical Review · doi:10.1103/physrev.65.117 · Cited by 6,510
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
The statistics of dimers on a lattice
Kasteleyn, P. W. (1961) · Physica · doi:10.1016/0031-8914(61)90063-5 · Cited by 1,258
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
Node-and edge-deletion NP-complete problems
Yannakakis, M. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804355 · Cited by 435
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations
Troyer, M., & Wiese, U.-J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.170201 · Cited by 1,246
Metadata
- Authors
- Barahona, F.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1982-10-01
- Volume
- 15
- Issue
- 10
- Pages
- 3241-3253
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W2013520638
- Cited by
- 1,306
- References
- 16
- FWCI
- 2.77
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the computational complexity of Ising spin glass models. https://app.cochat.ai/papers/10.1088/0305-4470/15/10/028
- The paper
- Barahona, F. (1982). On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/15/10/028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.