scientific article
From MaRDI portal
Publication:3728091
zbMath0596.12001MaRDI QIDQ3728091
Erich L. Kaltofen, Heinrich Rolletschek
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmscomputational number theorypolynomial running timecomputing the greatest common divisorfactorization of integerring of integers of quadratic field
Analysis of algorithms and problem complexity (68Q25) Quadratic extensions (11R11) Units and factorization (11R27) Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (7)
Shortest division chains in unique factorization domains ⋮ On the number of divisions of the Euclidean algorithm applied to Gaussian integers ⋮ The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders ⋮ Shortest division chains in imaginary quadratic number fields
This page was built for publication:
