Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
|
   
Mobile Device Pairing
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(e) ISSN 0025-5718(p)

     

A Fast algorithm to compute cubic fields

Author(s): K. Belabas.
Journal: Math. Comp. 66 (1997), 1213-1237.
MSC (1991): Primary 11R16, 11Y40
MathSciNet review: 1415795
Retrieve article in: PDF
This article is available free of charge

Abstract | Similar articles | Additional information

Abstract: We present a very fast algorithm to build up tables of cubic fields. Real cubic fields with discriminant up to $10^{11}$ and complex cubic fields down to $-10^{11}$ have been computed.


Similar Articles:

Retrieve articles in Mathematics of Computation with MSC (1991): 11R16, 11Y40

Retrieve articles in all Journals with MSC (1991): 11R16, 11Y40


Additional Information:

K. Belabas
Affiliation: Département de Mathématiques (A2X), Université Bordeaux I, 351, cours de la Libération, 33405 Talence, France
Address at time of publication: Max-Plank-Institut für Mathematik, Gottfried-Claren-str. 26, 53.225 Bonn, Germany
Email: belabas@math.u-bordeaux.fr

DOI: 10.1090/S0025-5718-97-00846-6
PII: S 0025-5718(97)00846-6
Keywords: Cubic fields, computations
Received by editor(s): February 2, 1996
Received by editor(s) in revised form: June 5, 1996
Copyright of article: Copyright 1997, American Mathematical Society




AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia