Suppose $f$ is uni-variate degree d polynomial have integer coefficient.
What will be shortest distance between any two real root of polynomial.
Can we compute this exact if not then upper and lower bound for the same.
Correction :Here I am assuming all roots are distinct