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.
Original language | English (US) |
---|---|
Title of host publication | Algorithmic Number Theory - 3rd International Symposium, ANTS-III 1998, Proceedings |
Editors | Joe P. Buhler |
Publisher | Springer Verlag |
Pages | 412-423 |
Number of pages | 12 |
ISBN (Print) | 3540646574, 9783540646570 |
State | Published - 1998 |
Externally published | Yes |
Event | 3rd International Symposium on Algorithmic Number Theory, ANTS 1998 - Portland, United States Duration: Jun 21 1998 → Jun 25 1998 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1423 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 3rd International Symposium on Algorithmic Number Theory, ANTS 1998 |
---|---|
Country/Territory | United States |
City | Portland |
Period | 6/21/98 → 6/25/98 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1998.