BigInteger Burnikel-Ziegler division algorithm crossover heuristic

Brian Burkhalter brian.burkhalter at
Mon Nov 25 15:30:57 UTC 2013

On Nov 23, 2013, at 4:04 AM, Dmitry Nadezhin wrote:

> Time complexity of Knuth divide a/b=q approximately the same as
> complexity of school multiplication b*q and is
> length(b)*length(q) = length(b) * (length(a) - length(b)).
> So the new heuristic seems reasonable for me.

Thanks, Dima.


More information about the core-libs-dev mailing list