3 papers
math.OC2026
Hardness of some optimization problems over correlation polyhedra
Alberto Caprara, Fabio Furini, Claudio Gentile +2
We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the rank-on…
cs.CL2025
Mathematics with large language models as provers and verifiers
Hieu Le Duc, Leo Liberti
During 2024 and 2025 the discussion about the theorem-proving capabilities of large language models started reporting interesting success stories, mostly to do with difficult exerc…
cs.CC2025
On Saxe's theorems about the complexity of the Distance Geometry Problem
Maël Kupperschmitt, Leo Liberti
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 hi…