Commit 5f643c34 authored by ZIMMERMANN Paul's avatar ZIMMERMANN Paul
Browse files

review of dlp240 polynomial selection

parent 9f039a3b
......@@ -18,7 +18,7 @@ commands as well.
We searched for a polynomial pair ``à la Joux-Lercier'', using the
program `dlpolyselect` of `cado-nfs`, with parameters `-bound 150`,
`-degree 4` and `-modm 1000003`. We tried also to use search for a skewed
`-degree 4` and `-modm 1000003`. We tried also to search for a skewed
pair of polynomials with the `-skewed` option, but this did not seem to
give a better polynomial for a fixed amount of time compared to plain
flat polynomials.
......@@ -56,7 +56,7 @@ process. This adds-up to 152 core.years for the whole polynomial selection.
Some sample-sieving was done on the top-100 polynomials according to
MurphyE. Although there is a clear correlation between the efficiency of
a polynomial pairs and it MurphyE, the ranking is definitely not perfect.
a polynomial pairs and its MurphyE value, the ranking is definitely not perfect.
In particular, the number-one polynomial pair according to MurphyE finds
10% less relations than the best ones.
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment