> 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. _______________________________________________ Bug-coreutils mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/bug-coreutils
