On Saxe's theorems about the complexity of the Distance Geometry Problem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918316341198848 |
|---|---|
| author | Kupperschmitt, Maël Liberti, Leo |
| author_facet | Kupperschmitt, Maël Liberti, Leo |
| contents | In 1979, James B.~Saxe published an extended summary on the complexity of the Distance Geometry Problem in the proceedings of the 17th Allerton Conference. Many of the proofs in his paper are sketches, and even the whole proofs do not have all the details. In this paper we provide a commentary to Saxe's results and hopefully more understandable versions thereof. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_00001 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Saxe's theorems about the complexity of the Distance Geometry Problem Kupperschmitt, Maël Liberti, Leo Computational Complexity Computational Geometry Metric Geometry In 1979, James B.~Saxe published an extended summary on the complexity of the Distance Geometry Problem in the proceedings of the 17th Allerton Conference. Many of the proofs in his paper are sketches, and even the whole proofs do not have all the details. In this paper we provide a commentary to Saxe's results and hopefully more understandable versions thereof. |
| title | On Saxe's theorems about the complexity of the Distance Geometry Problem |
| topic | Computational Complexity Computational Geometry Metric Geometry |
| url | https://arxiv.org/abs/2602.00001 |