The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a… (More)

An integer greatest common divisor (GCD) algorithm due to Schönhage is generalized to hold in all euclidean domains which possess a fast multiplication algorithm. It is shown that if two N precision… (More)

The current proposals for applying the so called “fast” O(N loga N) algorithms to multivariate polynomials is that the univariate methods be applied recursively, much in the way more conventional… (More)

Virtually all algebraic manipulation systems are very large programs which can only be run on the largest computers, and even then press the limits of the machines resources [1]. I see this as the… (More)