NTT multiplication.

[David Harvey]

On May 12, 2009, at 4:04 PM, Aleksey Bader wrote:

> P.S. Reletevly recent, Martin Furer published new multiplication  
> algorithm with very low asymptotic complexity.
> Q3. Any known (tries of) implementions (in GMP O:)? Maybe someone  
> think about it (disregard to author's claim that his method  
> outperforms  Schönhage-Strassen on "astonomically large  
> numbers" :-) )?

Dan Bernstein has some notes on this, he seems to think it could be  
practical:

http://www.nabble.com/fuerer-multiplication-td10235943.html

david

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://gmplib.org/list-archives/gmp-devel/attachments/20090513/d60c51e4/attachment.html>