The Euclidean algorithm
Paola Boito · Edizioni della Normale eBooks · 2011
The Euclidean algorithm is probably the oldest and most widely known method for GCD computations and there are a number of efficient Euclidean-based methods for computing polynomial GCDs, beginning with the work of Collins and Brown (see [38, 25, 26]). These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.