The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
다항식의 gcd를 계산하기 위해 유클리드 알고리즘이 사용됩니다. 우리는 알려진 유클리드 알고리즘의 복잡성을 추정합니다. 또한 우리는 경험적 유클리드 알고리즘을 제안합니다. 이는 반복적인 Karatsuba 곱셈을 사용하여 일부 특수한 조건에서 일반적인 방법보다 빠릅니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Yuichi FUTA, Koh-ichi NAGAO, "On the Euclidean Algorithm of Polynomials" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1261-1265, May 2001, doi: .
Abstract: In order to compute gcd of polynomials, the Euclidean algorithm is used. We estimate the complexities of known Euclidean algorithms. Further, we propose a heuristic Euclidean algorithm. This is faster than ordinary methods under some special conditions by the use of the recurrent Karatsuba multiplication.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1261/_p
부
@ARTICLE{e84-a_5_1261,
author={Yuichi FUTA, Koh-ichi NAGAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Euclidean Algorithm of Polynomials},
year={2001},
volume={E84-A},
number={5},
pages={1261-1265},
abstract={In order to compute gcd of polynomials, the Euclidean algorithm is used. We estimate the complexities of known Euclidean algorithms. Further, we propose a heuristic Euclidean algorithm. This is faster than ordinary methods under some special conditions by the use of the recurrent Karatsuba multiplication.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - On the Euclidean Algorithm of Polynomials
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1261
EP - 1265
AU - Yuichi FUTA
AU - Koh-ichi NAGAO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - In order to compute gcd of polynomials, the Euclidean algorithm is used. We estimate the complexities of known Euclidean algorithms. Further, we propose a heuristic Euclidean algorithm. This is faster than ordinary methods under some special conditions by the use of the recurrent Karatsuba multiplication.
ER -