Ciao!
Il Ven, 9 Dicembre 2011 2:39 pm, Torbjorn Granlund ha scritto:
> The code is about 2.5 times faster than the old code, at least for
> arguments of the type 2n over n. (This code as well as the old code is
> still slow for large operands; we need a factorisation based algorithm
> over a thre
I rewrote the new code using the same basic algorithm. This is now
probably close to correct. It passes lots of tests.
The code is about 2.5 times faster than the old code, at least for
arguments of the type 2n over n. (This code as well as the old code is
still slow for large operands; we need
