Document Type
Conference Proceeding
Publication Date
1998
Publication Title
ANTS III: Springer Lecture Notes in Computer Science
Abstract
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.
First Page
412
Last Page
423
DOI
https://doi.org/10.1007/BFb0054880
Rights
© Springer-Verlag Berlin Heidelberg 1998
Recommended Citation
John W. Jones and David P. Roberts. Timing Analysis of Targeted Hunter Searches. In ANTS III: Algorithmic Number Theory. Berlin: Springer (1998), 412-423.
Primo Type
Conference Proceeding
Comments
This is a pre-publication version of an chapter published in ANTS III: Algorithmic Number Theory (1998). The final authenticated version is available online at: https://doi.org/10.1007/BFb0054880