A fast algorithm to compute cubic fields

From MaRDI portal
Publication:4340867


DOI10.1090/S0025-5718-97-00846-6zbMath0882.11070MaRDI QIDQ4340867

Karim Belabas

Publication date: 15 June 1997

Published in: Mathematics of Computation (Search for Journal in Brave)


11Y40: Algebraic number theory computations

11R16: Cubic and quartic extensions


Related Items

Tables of octic fields with a quartic subfield, Constructing complete tables of quartic fields using Kummer theory, On quadratic fields with large 3-rank, A Database for Field Extensions of the Rationals, An algorithm to compute relative cubic fields, Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian, An error estimate for counting S3-sextic number fields, Computing the torsion of the 𝑝-ramified module of a number field, On the Davenport-Heilbronn theorems and second order terms, Secondary terms in counting functions for cubic fields, The Deligne-Mumford compactification of the real multiplication locus and Teichmüller curves in genus 3, Small isospectral and nonisometric orbifolds of dimension 2 and 3, Extremal families of cubic Thue equations, Error estimates for the Davenport-Heilbronn theorems, Some explicit upper bounds for residues of zeta functions of number fields taking into account the behavior of the prime \(2\), Dirichlet series associated to cubic fields with given quadratic resolvent, Counting discriminants of number fields, On the representation of unity by binary cubic forms, Density of cubic field discriminants, Tabulation of cubic function fields via polynomial binary cubic forms, Quadratic p-ring spaces for counting dihedral fields, Construction of all cubic function fields of a given square-free discriminant, DISCRIMINANTS CUBIQUES ET PROGRESSIONS ARITHMÉTIQUES, Mordell’s equation: a classical approach, Reduction of Binary Cubic and Quartic Forms