This work addresses the problem of computing a certified ε-approximation of all real roots of
a square-free integer polynomial. We proof an upper bound for its bit complexity, by …