James Wanless on Sat, 12 Mar 2011 15:05:45 +0100
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Just realized I (probably?) sent this to the wrong list - I'll try and get it right in future!|
Begin forwarded message:
Date: 12 March 2011 13:34:35 GMT
Subject: Polrootsmod query
Why is PARI's implementation of polrootsmod so fast??? :)))
I've implemented my own version using GMP and Algorithm 1.6.1 of Cohen ACCANT, but PARI's seems order(s) of magnitude faster.
What algorithm does polrootsmod use, pls? Maybe Cantor-Zassenhaus split etc., ie Cohen Algorithms 3.4.x, using matrices?? I've looked at PARI's code and haven't (yet?) understood it, despite noticing a few references to 'Berlekamp'...