| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Search results
Create the page "SNFS difficulty" on this wiki! See also the search results found.
- *[[Remaining Cunningham composites sorted by difficulty]] *[[SNFS Polynomial Generation Calculator]]614 bytes (69 words) - 12:08, 13 February 2019
- For the [[special number field sieve|SNFS]] [[factorization]] you need two polynomials with small coefficients and a ...on the rational side. Multiplying ''N'' by a constant increases the [[SNFS difficulty]] of the factorisation.7 KB (1,238 words) - 16:14, 12 February 2019
