Timing analysis of targeted hunter searches

John W. Jone, David P. Roberts

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationAlgorithmic Number Theory - 3rd International Symposium, ANTS-III 1998, Proceedings
EditorsJoe P. Buhler
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540646574, 9783540646570
StatePublished - 1998
Externally publishedYes
Event3rd International Symposium on Algorithmic Number Theory, ANTS 1998 - Portland, United States
Duration: Jun 21 1998Jun 25 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Symposium on Algorithmic Number Theory, ANTS 1998
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


Dive into the research topics of 'Timing analysis of targeted hunter searches'. Together they form a unique fingerprint.

Cite this