Shortest division chains in imaginary quadratic number fields

DOI10.1016/S0747-7171(08)80016-8zbMath0764.11053MaRDI QIDQ1813694

Heinrich Rolletschek

Publication date: 25 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

imaginary quadratic fieldEuclidean algorithmshortest division chain

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (5)

Shortest division chains in unique factorization domains ⋮ On the asymptotic analysis of the Euclidean algorithm ⋮ The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ The number of steps in the Euclidean algorithm over complex quadratic fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• A complete determination of the complex quadratic fields of class-number one
• About Euclidean rings
• A weakening of the euclidean property for integral domains and applications to algebraic number theory. I.

This page was built for publication: Shortest division chains in imaginary quadratic number fields