Computer algebra: symbolic and algebraic computation (2nd ed.)
Journal of Symbolic Computation
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Generic computation of the real closure of an ordered field
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Dynamic evaluation and real closure
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Computing in the field of complex algebraic numbers
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
New structure theorem for subresultants
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
Univariate real root isolation in multiple extension fields
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Hi-index | 0.00 |
This paper presents a new encoding scheme for real algebraic number manipulations which enhances current Axiom's Real Closure. Algebraic manipulations are performed using different instantiations of sub-resultant like algorithms instead of Euclidean algorithms. This allows us to work in the ring of real algebraic integers instead of the field of real algebraic numbers avoiding many denominators.