Practical fast polynomial multiplication

  title={Practical fast polynomial multiplication},
  author={Robert T. Moenck},
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 common defect that the size of the problem at which they start to be better than the classical method is quite large; so large, in fact that it is impractical to use them in an algebraic manipulation system. A number of techniques are discussed here for improving these fast algorithms. The combination… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS