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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    On the equivalence of polynomial GCD and squarefree factorization problems


    Contributors:


    Publication date :

    1977-01-01


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English




    A Reduction Method for Multivariable Polynomial Factorization

    Tzafestas, S. G. / Mastorakis, N. E. / Theodorou, N. J. et al. | British Library Conference Proceedings | 1994


    Polynomial Factorization Via Solving Differential Equations and Toeplitz System of Equations

    Hwang, C. / Hwang, J.-H. / Lin, B.-W. et al. | British Library Online Contents | 1996



    Equivalence principle for water-exit and -entry problems

    Moran, J.P. | Engineering Index Backfile | 1960


    Implicit Approximate-Factorization Schemes for Steady Transonic Flow Problems

    W. F. Baiihaus / A. Jameson / J. Albert | AIAA | 1978