The DOI matches its Crossref record.
Computational complexity of the ground-state determination of atomic clusters
Open accessAbstract
The authors prove that determining the ground state of a cluster of identical atoms, interacting under two-body central forces, belongs to the class of NP-hard problems. This means that as yet no polynomial time algorithm solving this problem is known and, moreover, that it is very unlikely that such an algorithm exists. It also suggests the need for good heuristics.
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
Cited by
The density functional formalism, its applications and prospects
Jones, R. O., & Gunnarsson, O. (1989) · Reviews of Modern Physics · doi:10.1103/revmodphys.61.689 · Cited by 4,014
Structural properties of nanoclusters: Energetic, thermodynamic, and kinetic effects
Baletto, F., & Ferrando, R. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.371 · Cited by 1,811
Molecular Geometry Optimization with a Genetic Algorithm
Deaven, D. M., & Ho, K. M. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.288 · Cited by 1,136
The effect of the range of the potential on the structures of clusters
Doye, J. P. K., Wales, D. J., & Berry, R. S. (1995) · The Journal of Chemical Physics · doi:10.1063/1.470729 · Cited by 395
Rapallo, A., Rossi, G., Ferrando, R., Fortunelli, A., Curley, B. C., Lloyd, L. D., Tarbuck, G. M., & Johnston, R. L. (2005) · The Journal of Chemical Physics · doi:10.1063/1.1898223 · Cited by 350
Metadata
- Authors
- Wille, L. T., & Vennik, J.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1985-06-01
- Volume
- 18
- Issue
- 8
- Pages
- L419-L422
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W2039988857
- Cited by
- 187
- References
- 0
- FWCI
- 3.33
- 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: Computational complexity of the ground-state determination of atomic clusters. https://app.cochat.ai/papers/10.1088/0305-4470/18/8/003
- The paper
- Wille, L. T., & Vennik, J. (1985). Computational complexity of the ground-state determination of atomic clusters. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/18/8/003
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.