ANTS III: Springer Lecture Notes in Computer Science
One can determine all primitive number fields of a given degree and discriminant with a finite search of potential defining polynomials. We develop an asymptotic formula for the number of polynomials which need to be inspected which reflects both archimedean and non-archimedean restrictions placed on the coefficients of a defining polynomial.
© Springer-Verlag Berlin Heidelberg 1998
John W. Jones and David P. Roberts. Timing Analysis of Targeted Hunter Searches. In ANTS III: Algorithmic Number Theory. Berlin: Springer (1998), 412-423.