Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
- 1 August 1974
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 8 (3) , 46-54
- https://doi.org/10.1145/1086837.1086844
Abstract
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear Hensel construction is shown to be generally more efficient than the Zassenhaus quadratic construction. The UNIGCD algorithm for UNIvariate polynomial GCD computations, based on the regular Hensel construction is then presented and compared with the Modular algorithm based on the Chinese Remainder Algorithm. From both an analytical and an experimental point of view, the UNIGCD algorithm is shown to be preferable for many common univariate GCD computations. This is true even for dense polynomials, which was considered to be the most suitable case for the application of the Modular algorithm.Keywords
This publication has 8 references indexed in Scilit:
- Factoring multivariate polynomials over the integersACM SIGSAM Bulletin, 1973
- The EZ GCD algorithmPublished by Association for Computing Machinery (ACM) ,1973
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- Modular arithmetic and finite field theoryPublished by Association for Computing Machinery (ACM) ,1971
- On Hensel factorization, IJournal of Number Theory, 1969
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Polynomial Remainder Sequences and DeterminantsThe American Mathematical Monthly, 1966