Re: sparse polynomial arithmetic

Please see the following draft paper

http://www.cs.berkeley.edu/~fateman/papers/shortprog.pdf

which, I think, outlines all the major approaches to polynomial
multiplication, and provides short working programs for each.
Any of the programs can be "optimized". The programs are between
about 12 lines of code to about 80 (for the FFT).

If you think you have a program that you feel does not fit in one of
the categories, I would appreciate hearing about it.

(Writing a program in a different language does not, in and of itself,
place it in a different category.)

Thanks in advance for comments.

Richard Fateman
.