January 1999
Intermediate to advanced
808 pages
19h 21m
English
There are two versions of Euclidean greatest common divisor (GCD) algorithms, one for integers, the other for polynomials. Both of them are presented in this appendix.
Read now
Unlock full access