Complexity of deciding the first-order theory of real closed fields

DOI10.1007/BF01098275zbMath0724.12009OpenAlexW2013955593MaRDI QIDQ2277024

Dima Yu. Grigoriev

Publication date: 1991

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01098275

zbMATH Keywords

complexitydecidability algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25) Ordered fields (12J15)

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• The complexity of elementary algebra and geometry
• Résolution des systèmes d'équations algébriques
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of deciding the first-order theory of real closed fields