On the Hardness of Energy Minimisation for Crystal Structure Prediction*
From MaRDI portal
Publication:5862342
DOI10.3233/FI-2021-2096OpenAlexW2981560061MaRDI QIDQ5862342
Igor Potapov, Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev
Publication date: 9 March 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2096
Related Items (2)
The k-centre problem for classes of cyclic words ⋮ Ranking binary unlabelled necklaces in polynomial time
Uses Software
Cites Work
- How to predict very large and complex crystal structures
- Unit disk graphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Hardness results for multimarginal optimal transport problems
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
- On the Hardness of Energy Minimisation for Crystal Structure Prediction
- Node-Deletion NP-Complete Problems
- Node-Deletion Problems on Bipartite Graphs
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Node-and edge-deletion NP-complete problems
This page was built for publication: On the Hardness of Energy Minimisation for Crystal Structure Prediction*
