Polynomial GCD Derived through Monic Polynomial Subtractions
Keyword(s):
A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived. The process requires only successive subtraction of two monic polynomials. Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as and its derivative.
2011 ◽
Vol E94-C
(10)
◽
pp. 1548-1556
◽
Keyword(s):
Decision Support System Based on Fuzzy Logic for Assessment of Expected Corporate Income Performance
2021 ◽
pp. 2150009
Keyword(s):
One Year
◽
1962 ◽
Vol 15
(3)
◽
pp. 525-534
◽
Keyword(s):
1967 ◽
Vol 113
(505)
◽
pp. 1405-1406
◽
Keyword(s):
Keyword(s):
Keyword(s):