The following pages link to (Q3916662):
Displaying 5 items.
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers (Q1086616) (← links)
- A fast Euclidean algorithm for Gaussian integers (Q1600038) (← links)
- Shortest division chains in imaginary quadratic number fields (Q1813694) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)