The following pages link to (Q2739476):
Displayed 6 items.
- 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)
- On Schönhage's algorithm and subquadratic integer gcd computation (Q5429518) (← links)
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)