Towards faster real algebraic numbers

DOI10.1016/S0747-7171(03)00093-2zbMath1064.11083OpenAlexW4212780959MaRDI QIDQ1878487

Renaud Rioboo

Publication date: 20 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(03)00093-2

zbMATH Keywords

Algebraic numbersFractionsAlgebraic integersReal closed fieldsReal closureSub-resultants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic number theory computations (11Y40)

Related Items

Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers ⋮ Symbolic-numeric integration of rational functions ⋮ Univariate real root isolation in an extension field and applications ⋮ Real Root Isolation of Regular Chains

Cites Work

• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Computing in the field of complex algebraic numbers
• Generic computation of the real closure of an ordered field.
• Dynamic evaluation and real closure.
• New structure theorem for subresultants
• Optimizations of the subresultant algorithm
• On the combinatorial and algebraic complexity of quantifier elimination
• Sylvester-Habicht sequences and fast Cauchy index computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item