Message70702
There's also the recursive division algorithm due
to Burnikel and Ziegler; this might be worth a look.
I think it's the same asymptotic complexity (constant
times karatsuba multiplication complexity), but may
turn out to be faster for one reason or another.
I had a Python implementation of this somewhere;
I'll see if I can dig it out.
Assigning this to me so that it doesn't get lost or
forgotten; but note that I don't intend to do
anything about it before 2.6/3.0 final. If anyone else
wants to take it off my hands before then, feel free. |
|
Date |
User |
Action |
Args |
2008-08-04 15:51:57 | mark.dickinson | set | recipients:
+ mark.dickinson, fredrikj |
2008-08-04 15:51:57 | mark.dickinson | set | messageid: <1217865117.4.0.953123905443.issue3451@psf.upfronthosting.co.za> |
2008-08-04 15:51:56 | mark.dickinson | link | issue3451 messages |
2008-08-04 15:51:55 | mark.dickinson | create | |
|