Faster table compute in mpn_sec_powm
Emmanuel.Thome at inria.fr
Tue Mar 20 15:24:54 UTC 2018
On Tue, Mar 20, 2018 at 04:13:54PM +0100, Paul Zimmermann wrote:
> > B^(2j) = (B^j)^2 (i.e., even values of i)
> > B^(2j+1) = (B^(2j))*B (i.e., odd values of i)
> this is a classical trick we use at several places in MPFR, and we mention
> in Modern Computer Algebra (page 142).
Paul, the title of your book is "Modern Computer Arithmetic" ;-).
> Does someone has an earlier reference for that trick?
> gmp-devel mailing list
> gmp-devel at gmplib.org
More information about the gmp-devel