Complexity of computation on real algebraic numbers

DOI10.1016/S0747-7171(08)80035-1zbMath0723.68054OpenAlexW2016506651MaRDI QIDQ757065

Aviva Szpirglas, Marie-Françoise Roy

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80035-1

zbMATH Keywords

real algebraic numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic numbers; rings of algebraic integers (11R04)

Related Items (13)

Polar varieties, real equation solving, and data structures: the hypersurface case ⋮ Effective asymptotics of linear recurrences with rational coefficients ⋮ Zero-nonzero and real-nonreal sign determination ⋮ Linear solving for sign determination ⋮ On Newton's rule and Sylvester's theorems ⋮ Determinantal formulae for the solution set of zero-dimensional ideals ⋮ NC algorithms for real algebraic numbers ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ A theorem on random polynomials and some consequences in average complexity ⋮ Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets ⋮ Sensing as a Complexity Measure ⋮ Generic computation of the real closure of an ordered field. ⋮ Dynamic evaluation and real closure.

Cites Work

• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• The complexity of elementary algebra and geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of computation on real algebraic numbers