Timing analysis of targeted hunter searches
- First Online:
- Cite this paper as:
- Jones J.W., Roberts D.P. (1998) Timing analysis of targeted hunter searches. In: Buhler J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.