Polynomial real root isolation using approximate arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Complexity of real root isolation using continued fractions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Some polynomial and Toeplitz matrix computations
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Complexity of real root isolation using continued fractions
Theoretical Computer Science
A generic algebraic kernel for non-linear geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
On the computing time of the continued fractions method
Journal of Symbolic Computation
Journal of Symbolic Computation
| Hi-index | 0.00 |
This paper deals with the two following topics: bounds for the heights of divisors of polynomials, minimal distance between distinct roots of integral univariate polynomials. In each case we recall the best known results, we give some new inequalities and, constructing suitable examples, we show that these inequalities are not “too bad”.