On the separation of the roots of a polynomial (extended abstract)
Maurice Mignotte · ACM SIGSAM Bulletin · 1976
In a recent paper COLLINS and HOROWITZ [1] considered the following problem: Let P be a polynomial with rational integer coefficients. If sep (P) is the minimum distance between distinct roots of P, find a good lower bound for sep (P). This question is important for the algorithms which calculate the roots of a polynomial (see [1] for a more detailed discussion).