[m-dev.] for review: big ints
Thomas Charles CONWAY
conway at cs.mu.OZ.AU
Fri Apr 3 20:29:31 AEST 1998
Bert Thompson, you write:
> Gday peoples,
> Could someone please review this addition to the library.
> P.S. The answer to your first question is "because it was there".
I wrote an equivalent module quite some time ago, but I never
included it because multiplication was O(N^2) (as yours is).
For it to be useful, it really needs the O(NlogN) version which
is considerably harder to implement.
Thomas Conway || conway at cs.mu.oz.au
AD DEUM ET VINUM || Nail here  for new monitor.
More information about the developers