Generic computation of the real closure of an ordered field.
From MaRDI portal
Cites work
- Algorithms for polynomial real root isolation
- Complexity of computation on real algebraic numbers
- Effective procedures in field theory
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 3920595 (Why is no real title available?)
- scientific article; zbMATH DE number 4055029 (Why is no real title available?)
- scientific article; zbMATH DE number 3041741 (Why is no real title available?)
- The complexity of elementary algebra and geometry
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Cited in
(3)
This page was built for publication: Generic computation of the real closure of an ordered field.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1565819)