Key points are not available for this paper at this time.
This paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The phenomenon of coefficient growth is described, and the history of successful efforts first to control it and then to eliminate it is related.
Warren S. Brown (Fri,) studied this question.