On classifying continuous constraint satisfaction problems

DOI10.1109/FOCS52979.2021.00081MaRDI QIDQ6943469zbMATH OpenFDO

Authors Reinier F. Schmiermann, Tillmann Miltzow

Publication date 13 August 2025

Full work available at URL https://dspace.library.uu.nl/handle/1874/415167

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(4)

• Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
• A topological version of Schaefer's dichotomy theorem
• The complexity of recognizing geometric hypergraphs

This page was built for publication: On classifying continuous constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943469)