The Euclidean algorithm
From MaRDI portal
Publication:5793391
Cites work
Cited in
(28)- About Euclidean rings
- Rabinowitsch times six
- Some arithmetic properties of subrings of function fields over finite fields
- Generalized Gröbner bases: Theory and applications. A condensation
- The restricted Nagata's pairwise algorithm and the Euclidean algorithm
- On Euclidean ideal classes in certain abelian extensions
- Euclidean algorithm in Galois quartic fields
- Lenstra-Hurwitz cliques and the class number one problem
- Suggested Corrections for “A Principal Ideal Domain That Is Not a Euclidean Domain”
- The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm
- Gow-Tamburini type generation of \(\mathrm{SL}_3(R)\) over the rings of integers of imaginary quadratic number fields of class number one
- The minimal Euclidean function on the Gaussian integers
- A Survey of Certain Euclidean Number Fields
- scientific article; zbMATH DE number 7136179 (Why is no real title available?)
- Recursive properties of Euclidean domains
- Products of idempotent matrices over integral domains
- Integrally Closed Subrings of an Integral Domain
- Growth results and Euclidean ideals
- On the divisibility of matrices with remainder over the domain of principal ideals
- A remark on the ring of algebraic integers in \(\mathbb{Q}(\sqrt {- d})\)
- Left Euclidean (2, 2)-Algebras
- On the D-bases of polynomial ideals over principal ideal domains
- Euclidean totally definite quaternion fields over the rational field and over quadratic number fields
- Transfinitely valued Euclidean domains have arbitrary indecomposable order type
- A note on Euclidean order types
- mathlib4 Module Mathlib/Algebra/EuclideanDomain/Defs
- Euclid's algorithm in global fields
- On a proposition of Samuel and 2-stage Euclidean algorithm in global fields
This page was built for publication: The Euclidean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5793391)
