Number Theoretic Library (NTL) by Shoup, now accessible from Lisp



The files are updated so that univariate polynomial
factorization can be done with a rather simple call.
NTL is supposed to be very fast on this. A spot
check against Maxima using x^500+x+1 shows Maxima
to be twice as fast, but this is probably exercises
one of the factoring hacks built in to Maxima.

> http://www.cs.berkeley.edu/~fateman/papers/lisp2ntl/README .
>
The files work for Allegro CL. I expect that the same C++ routines
would work with other lisps, though the foreign-function declarations
would have to be modified.

RJF