[CST-2] Advanced Algorithms

[Alvin]

> As for the big number Arithmetic, it's mostly in Knuth Vol II under the
> "How fast can we multiply" section; however Knuth's explanations deviate
> somewhat from the ones which ACN provided and hence it may not be
> particularly
> useful.  I took notes for this part of the course (everything he said/wrote
> down),
> but I'm finding them pretty indecipherable so if anyone has found another
> useful reference on this area I'd be grateful to hear about it!
> 
> David

It's in Introduction to Algorithms, under the section polynomial arithmetic
(I think...)  It's basically the Fast Fourier Transform.

Alvin