1 citations · 1 across the 1 of their papers we have counts for
1 paper
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
The classical heuristic complexity of the Number Field Sieve (NFS) is the solution of an optimization problem that involves an unknown function, usually noted o(1) and called $ξ(…