20 pages Version Preliminaire en Francais : hal-00406357 (2009)
This 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 an univariate polynomial is obtained.
ISSN: 0195-6698 EISSN: 1095-9971 European Journal of Combinatorics https://hal.archives-ouvertes.fr/hal-00624447 European Journal of Combinatorics, Elsevier, 2012, 33 (7), pp.1369-1385. 〈10.1016/j.ejc.2012.03.003〉ARRAY(0x7f5470737bd0) 2012-10