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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    On the equivalence of polynomial GCD and squarefree factorization problems


    Beteiligte:
    Yun, D. Y. Y. (Autor:in)


    Erscheinungsdatum :

    01.01.1977


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Keine Angabe


    Sprache :

    Englisch


    Schlagwörter :


    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