diff options
| author | Kevin B Kenny <kennykb@acm.org> | 2005-04-10 23:54:55 (GMT) |
|---|---|---|
| committer | Kevin B Kenny <kennykb@acm.org> | 2005-04-10 23:54:55 (GMT) |
| commit | d2b645df1ab7b43093f7553808c64fedaa3b3a49 (patch) | |
| tree | 99103342350cd1fb4776a60684221ad722fdec52 /libtommath/bn_mp_toom_mul.c | |
| parent | b9cf65a08e6a59e434685e894e3189c201ac6791 (diff) | |
| download | tcl-d2b645df1ab7b43093f7553808c64fedaa3b3a49.zip tcl-d2b645df1ab7b43093f7553808c64fedaa3b3a49.tar.gz tcl-d2b645df1ab7b43093f7553808c64fedaa3b3a49.tar.bz2 | |
Import of tommath 0.35
Diffstat (limited to 'libtommath/bn_mp_toom_mul.c')
| -rw-r--r-- | libtommath/bn_mp_toom_mul.c | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/libtommath/bn_mp_toom_mul.c b/libtommath/bn_mp_toom_mul.c index 2d66779..125331b 100644 --- a/libtommath/bn_mp_toom_mul.c +++ b/libtommath/bn_mp_toom_mul.c @@ -17,9 +17,10 @@ /* multiplication using the Toom-Cook 3-way algorithm * - * Much more complicated than Karatsuba but has a lower asymptotic running time of - * O(N**1.464). This algorithm is only particularly useful on VERY large - * inputs (we're talking 1000s of digits here...). + * Much more complicated than Karatsuba but has a lower + * asymptotic running time of O(N**1.464). This algorithm is + * only particularly useful on VERY large inputs + * (we're talking 1000s of digits here...). */ int mp_toom_mul(mp_int *a, mp_int *b, mp_int *c) { |