A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Can post-SchönhageStrassen multiplication algorithms be competitive in practice for large input sizes? So far, the GMP library still outperforms all implementations of the recent, asymptotically more ecient algorithms for integer multiplication by Fürer, DeKururSahaSaptharishi, and ourselves. In this paper, we show how central ideas of our recent asymptotically fast algorithms turn out to be of practical interest for multiplication of polynomials over nite fields of characteristic two. Ourdoi:10.1145/2930889.2930920 dblp:conf/issac/HarveyHL16 fatcat:3uwa3q4i3rgljmwplbfl43plji