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.
No takes yet. Share an insight, caveat, or question.
Warren S. Brown (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: