| タイトル | On the equivalence of polynomial GCD and squarefree factorization problems |
| 著者（英） | Yun, D. Y. Y. |
| 著者所属（英） | IBM Watson Research Center |
| 発行日 | 1977-01-01 |
| 言語 | eng |
| 内容記述 | 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. |
| NASA分類 | NUMERICAL ANALYSIS |
| レポートNO | 77N28756 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/440647 |
