On Saxe's theorems about the complexity of the Distance Geometry Problem
Ma\"el Kupperschmitt, Leo Liberti

TL;DR
This paper revisits and clarifies Saxe's 1979 results on the complexity of the Distance Geometry Problem, providing detailed and more understandable proofs to enhance comprehension.
Contribution
It offers a detailed commentary and clearer proofs of Saxe's original theorems on the complexity of the Distance Geometry Problem.
Findings
Clarified the complexity status of the Distance Geometry Problem
Provided detailed proofs of Saxe's theorems
Enhanced understanding of the original results
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · graph theory and CDMA systems · Historical Geography and Cartography
