Generic computation of the real closure of an ordered field.

DOI10.1016/S0378-4754(96)00031-6zbMath1037.68546MaRDI QIDQ1565819

N. Delaunay

Publication date: 27 May 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

zbMATH Keywords

computer algebraaxiomreal algebraic number

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordered fields (12J15)

Related Items (3)

Towards faster real algebraic numbers ⋮ Finding at least one point in each connected component of a real algebraic set defined by a single equation ⋮ Dynamic evaluation and real closure.

Uses Software

• IBM Scratchpad

Cites Work

• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Complexity of computation on real algebraic numbers
• The complexity of elementary algebra and geometry
• Effective procedures in field theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic computation of the real closure of an ordered field.