Algebraic computation of resolvents without extraneous powers

AbstractThis paper presents an algorithm for computing algebraically relative resolvents which enhances an existing algorithm by avoiding the accumulation of superfluous powers in the intermediate computations. The superfluous power generated at each step is predetermined over a certain quotient ring. As a byproduct, an efficient algorithm for extracting an n-th root of a univariate polynomial is obtained