>> Are you aware of faster-than-n^2 multiplication algorithms [...]
> Actually, when the algorithm is to square a value, the difficulty
> reduces to ONLY ( n^2 + n ) / 2 which is
...still O(n^2). :-)
> IN ADDITION, it is the Lucas-Lehmer primality test:
I should look it up someday. (The Wikiped
>Mouse wrote:
Quite recently, I have a requirement to square very large unsigned
integers up to one billion bits [...]
Are you aware of faster-than-n^2 multiplication algorithms like
Actually, when the algorithm is to square a value, the difficulty
reduces to ONLY
( n^2 + n ) / 2 which is
