Subject: Re: [boost] [xint] Third release is ready, requesting preliminary review
From: Chad Nelson (chad.thecomfychair_at_[hidden])
Date: 2010-05-02 17:03:59
-----BEGIN PGP SIGNED MESSAGE-----
On 05/02/2010 04:39 PM, DE wrote:
>>> I'm curious: Are you researching, or do you have plans to research,
>>> more efficient multiplication algorithms (Karatsuba's, FFT-based, etc.)?
>>> I believe these only become efficient at large integers, but I'm not
>>> sure how large...
>> Yes, I already have a description of the Karatsuba one to work from, for
>> a later release. It's supposed to be more effective than the traditional
>> version once you get past a certain size, but I don't know what that
>> size is yet. Once that's added, I'll look into the others.
> wikipedia says that kartsuba gains any advantage starting from ~10000
> _decimal_ digits (that is roughly )
Ah, thanks. I'll have to run my own tests to confirm it, once I've
implemented Karatsuba, but it sounds like that wouldn't be used all that
often, at least with the size of numbers that I'm used to dealing with.
Oak Circle Software, Inc.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.10 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/
-----END PGP SIGNATURE-----
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk