scientific article; zbMATH DE number 3853202

MaRDI QIDQ3322188zbMATH OpenFDO

Authors Heinrich Rolletschek

Publication date 1983

zbMATH Keywords

Euclidean algorithm for Gaussian integersmaximal number of divisions

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Algebraic numbers; rings of algebraic integers (11R04) Quadratic extensions (11R11)

Recommendations

• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• A fast Euclidean algorithm for Gaussian integers
• The number of steps in the Euclidean algorithm over complex quadratic fields
• scientific article; zbMATH DE number 3305966
• Performance of a GCD algorithm for Gaussian integers

Cited in

(11)

• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Computer algebra: Past and future
• A fast Euclidean algorithm for Gaussian integers
• The Euclid algorithm is ``totally Gaussian
• scientific article; zbMATH DE number 1222534 (Why is no real title available?)
• Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• Euclidean algorithm for a class of linear orders
• The number of steps in the Euclidean algorithm over complex quadratic fields
• A Euclidean algorithm for normal bases

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322188)