Message169692
My review is done. The Karatsuba function is basically a small stack machine
and very hard to prove formally as far as I can see. The algorithm is cited
in TAOCP and the subdivision is brute force tested for all combinations of
coefficient lengths of the two input operands that are used in libmpdec
(currently 256 < nwords <= 1024). |
|
Date |
User |
Action |
Args |
2012-09-02 12:17:24 | skrah | set | recipients:
+ skrah, lemburg, rhettinger, amaury.forgeotdarc, mark.dickinson, pitrou, vstinner, casevh, eric.smith, benjamin.peterson, jjconti, Arfrever, ced, asvetlov, Amaury.Forgeot.d'Arc, python-dev, eric.snow, Ramchandra Apte, Jim.Jewett |
2012-09-02 12:17:23 | skrah | set | messageid: <1346588243.94.0.985787193458.issue7652@psf.upfronthosting.co.za> |
2012-09-02 12:17:23 | skrah | link | issue7652 messages |
2012-09-02 12:17:23 | skrah | create | |
|