Skip to main content
SpringerLink
Log in

Verallgemeinerte Euklidische Algorithmen

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literaturverzeichnis

  1. J. Blöhmer, Euklidische Ringe. Diplomarbeit, FU Berlin 1989.

    Google Scholar 

  2. H. W. Lenstra jr., Euclidean number fields of large degree. Invent. Math.38, 237–254 (1977).

    Google Scholar 

  3. H. W. Lenstra jr., Euclidean ideal classes. J. arithmetiques de Luminy. Asterisque61, 121–131 (1979).

    Google Scholar 

  4. A. Leutbecher, Euclidean number fields having a large Lenstra constant. Ann. Inst. Fourier, (Grenoble)35, 83–106 (1985).

    Google Scholar 

  5. F. J.van der Linden, Euclidean rings with two infinite primes. Ph. D. thesis, Univ. Amsterdam, 1984.

  6. V. Schulze, Verallgemeinerte Euklidische Algorithmen. Preprint, FU Berlin 1995.

    Google Scholar 

Download references

Author information

Author notes

  1. Volker Schulze

    Present address: Fachbereich Mathematik Institut f. Mathematik II, Freie Universität Berlin, Arnimallee 3, D-14195, Berlin

Authors and Affiliations

    Authors
    1. Volker Schulze
      View author publications

      You can also search for this author in PubMed Google Scholar

    Rights and permissions

    Reprints and permissions

    About this article

    Cite this article

    Schulze, V. Verallgemeinerte Euklidische Algorithmen. Arch. Math 64, 313–315 (1995). https://doi.org/10.1007/BF01198085

    Download citation

    • Received:

    • Issue Date:

    • DOI: https://doi.org/10.1007/BF01198085

    Search

    Navigation