division-free binary-to-decimal conversion

[Niels Möller]

Zimmermann Paul <Paul.Zimmermann at inria.fr> writes:

> with Cyril Bouvier we have written a preprint describing several division-free
> algorithms to convert from binary to decimal (the mp?_get_str routines):
>
> 	   http://www.loria.fr/~zimmerma/papers/get_str.pdf

I've had a first reading. Seems to give impressive speedups. And nice
with another application of mulmid.

I think I noticed one typo: On page 3, the second inequality just
after Eq. (3), should probably say 0 <= y/2^n < 1, not 0 <= y b^k / 2^n
< 1.

Regards,
/Niels

-- 
Niels Möller. PGP-encrypted email is preferred. Keyid C0B98E26.
Internet email is subject to wholesale government surveillance.