Thread: ppyNFS
View Single Post
Old 2015-03-31, 10:48   #4
paul0
 
Sep 2011

1110012 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I did not dig into your polynomial root finder. May I ask what method you use?
I used the recursive "random splitting" algorithm as described in page 103 of Prime Numbers: A Computational Perspective. See functions getRootsModPFast() and getRootsModPSlow() in poly.py.

Quote:
Originally Posted by R.D. Silverman View Post
(3) I did not look at your filtering/matrix preparation code. If you have not done so, you will need
to implement a clique based filter.
Though not currently uploaded, I have code that does singleton filtering.

Everything else you've mentioned is a future goal, but I'll need to invest time to study and implement them.

Last fiddled with by paul0 on 2015-03-31 at 10:51
paul0 is offline   Reply With Quote