Pages that link to "Item:Q5926303"
From MaRDI portal
The following pages link to \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303):
Displayed 5 items.
- Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings (Q1015166) (← links)
- A fast Euclidean algorithm for Gaussian integers (Q1600038) (← links)
- Fast computation of the biquadratic residue symbol. (Q1864853) (← links)
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)