Pages that link to "Item:Q1086616"

The following pages link to On the number of divisions of the Euclidean algorithm applied to Gaussian integers (Q1086616):

Displaying 8 items.

• Shortest division chains in unique factorization domains (Q277230) (← links)
• The number of steps in the Euclidean algorithm over complex quadratic fields (Q807674) (← links)
• On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
• A fast Euclidean algorithm for Gaussian integers (Q1600038) (← links)
• Shortest division chains in imaginary quadratic number fields (Q1813694) (← links)
• The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields (Q2229704) (← links)
• Efficient solution of rational conics (Q4806396) (← links)
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)