Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.
Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.

Graeme Taylor
University of Bristol
About this blog

