Generic computation of the real closure of an ordered field.
From MaRDI portal
Publication:1565819
DOI10.1016/S0378-4754(96)00031-6zbMath1037.68546MaRDI QIDQ1565819
Publication date: 27 May 2003
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Related Items
Finding at least one point in each connected component of a real algebraic set defined by a single equation, Dynamic evaluation and real closure., Towards faster real algebraic numbers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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