It is shown that a closer reexamination of Yun's 1976 paper reveals the reducibility of SQFR to GCD. The natural question that follows is whether GCD is reducible to SQFR. That is answered affirmatively and the derivation actually suggests an algorithm for computing GCD's when input polynomials are already represented by their SQFR form.
On the equivalence of polynomial GCD and squarefree factorization problems
01.01.1977
Aufsatz (Konferenz)
Keine Angabe
Englisch
A Reduction Method for Multivariable Polynomial Factorization
British Library Conference Proceedings | 1994
|Polynomial Factorization Via Solving Differential Equations and Toeplitz System of Equations
British Library Online Contents | 1996
|Equivalence principle for water-exit and -entry problems
Engineering Index Backfile | 1960
|