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
Polynomial real root isolation using approximate arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A new constructive root bound for algebraic expressions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Constructive root bound for k-ary rational input numbers
Proceedings of the nineteenth annual symposium on Computational geometry
Towards faster real algebraic numbers
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
The design of core 2: a library for exact numeric computation in geometry and algebra
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
The LEDA number type real is extended by the diamond operator, which allows to compute exactly with real algebraic numbers given as roots of polynomials. The coefficients of these polynomials can be arbitrary real algebraic numbers. The implementation is presented and experiments with two other existing implementations of real algebraic numbers (CORE, EXACUS) are done.