Algorithme explicite pour la recherche du p.g.c.d. dans certains anneaux principaux d'entiers de corps de nombres

DOI10.1016/0304-3975(80)90046-8zbMath0425.13007OpenAlexW2079431101MaRDI QIDQ1135322

B. Bougaut

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90046-8

zbMATH Keywords

factorizationBezout ringreal quadratic number fieldclass number 1g c dquasi-euclidean ring

Mathematics Subject Classification ID

Quadratic extensions (11R11) Units and factorization (11R27) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05)

Related Items (1)

Quasi-Euclidean subrings of ℚ[x]

Cites Work

• Unnamed Item
• The inhomogeneous minima of binary quadratic forms. I
• A weakening of the euclidean property for integral domains and applications to algebraic number theory. II.
• ON THE GROUPSL₂OVER DEDEKIND RINGS OF ARITHMETIC TYPE

This page was built for publication: Algorithme explicite pour la recherche du p.g.c.d. dans certains anneaux principaux d'entiers de corps de nombres