|
From: | Jim Meyering |
Subject: | Re: Faster algorithm for factor? |
Date: | Mon, 05 Jan 2004 00:56:10 +0100 |
> Are there any plans to implement faster algorithms in factor? For 64-bit > integers Pollard's rho method would be a good choice. I have an > implementation that is hundreds of times faster than factor for > large inputs. Is anyone interested in this? Sounds interesting to me.
[Prev in Thread] | Current Thread | [Next in Thread] |