Advertisement

Computing cubic fields in quasi-linear time

  • K. Belabas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1122)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Belabas, K. A fast algorithm to compute cubic fields (to appear in Math. Comp.).Google Scholar
  2. 2.
    Davenport, H. On the class number of binary cubic forms (I), J. Lond. Math. Soc.26 (1951), pp. 183–192. (erratum, ibid27, p. 512).Google Scholar
  3. 3.
    Davenport, H. On the class number of binary cubic forms (II), J. Lond. Math. Soc.26 (1951), pp. 192–198.Google Scholar
  4. 4.
    Davenport, H. & Heilbronn, H. On the density of discriminants of cubic fields (II) Proc.Roy.Soc.Lond.A322 (1971), 405–420.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • K. Belabas
    • 1
  1. 1.Département de mathématiques (A2X)Université Bordeaux ITalenceFrance

Personalised recommendations