A fast Euclidean algorithm for Gaussian integers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3853202
- Performance of a GCD algorithm for Gaussian integers
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- scientific article; zbMATH DE number 1643956
Cites work
- scientific article; zbMATH DE number 1643956 (Why is no real title available?)
- scientific article; zbMATH DE number 3728392 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- The Computing Time of the Euclidean Algorithm
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
Cited in
(12)- Fast computation of the biquadratic residue symbol.
- scientific article; zbMATH DE number 3853202 (Why is no real title available?)
- Performance of a GCD algorithm for Gaussian integers
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- The Euclid algorithm is ``totally Gaussian
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- New fast Euclidean algorithms
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
- scientific article; zbMATH DE number 1643956 (Why is no real title available?)
- A Paper-and-Pencil gcd Algorithm for Gaussian Integers
- Testing elementary function identities using CAD
This page was built for publication: A fast Euclidean algorithm for Gaussian integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600038)
