At 09:21 AM 6/17/99 -0700, jrp wrote:
>[...]multiplying 2 128 bit integers X * Y where Xh and Xl are the high
>and low half of the X argument takes 4 multiples plus a few adds.
It can be done in fewer than 4 muliplies. See Karatsuba's Method in
Knuth's TAOCP, Vol 2, Section 4.3.3, "How Fast Can We Multiply?"
Not as sexy as it used to be because multiplication is sooo fast
now-a-days. But it still might come in handy.
BTW, has anybody investigated this package:
http://clisp.cons.org/~haible/packages-cln-README.html
--Luke
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
