2 papers
cs.CG2025
Devil's Games and : Continuous Games complete for the First-Order Theory of the Reals
Lucas Meijer, Arnaud de Mesmay, Tillmann Miltzow +2
We introduce the complexity class Quantified Reals (). Let FOTR be the set of true sentences in the first-order theory of the reals. A language is in $\text…
cs.CG2025
Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
Anna Lubiw, Marcus Schaefer
We show that the recognition problem for penny graphs (contact graphs of unit disks in the plane) is -complete, that is, computationally as hard as the existenti…