Nussbaumer polynomial multiplication

Torbjorn Granlund tg at
Mon May 3 02:01:31 CEST 2004

Josh Liu <zliu2 at> writes:

  Also, if someone can give me a
  good description of the Nussbaumer algorithm, better than Knuth's, I would
  very much appreciate it :)
Nussbaumer published a book in the early 80'ies that is more readable
that Knuth's description.

I implemented it a few years after the book was published, and
determined that it was too slow.  Here is my very old code:

-------------- next part --------------
A non-text attachment was scrubbed...
Name: mpn_mul_nuss.c.gz
Type: application/octet-stream
Size: 3118 bytes
Desc: not available
Url : /list-archives/gmp-discuss/attachments/20040503/d60fc148/mpn_mul_nuss.c.obj
-------------- next part --------------

If your code is faster than Sch?nhage, that'd be interesting.
I'd want hard numbers to be convinced, though.  :-)


More information about the gmp-discuss mailing list