Timing analysis of targeted hunter searches

  • John W. Jones
  • David P. Roberts
Conference paper

DOI: 10.1007/BFb0054880

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1423)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • John W. Jones
    • 1
  • David P. Roberts
    • 2
  1. 1.Department of MathematicsArizona State UniversityTempe
  2. 2.Department of Mathematics, Hill CenterRutgers UniversityNew Brunswick

Personalised recommendations