Computational complexity of diagram satisfaction in Euclidean geometry

DOI10.1016/J.JCO.2005.09.003zbMath1156.52301OpenAlexW2048639138MaRDI QIDQ2489144

Nathaniel Miller

Publication date: 16 May 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2005.09.003

zbMATH Keywords

Euclidean geometryDiagramsComputational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55)

Related Items (1)

On the inconsistency of Mumma's Eu

Cites Work

• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of diagram satisfaction in Euclidean geometry