scientific article; zbMATH DE number 3959562
From MaRDI portal
Publication:3728091
algorithmscomplexitycomputational number theorypolynomial running timecomputing the greatest common divisorfactorization of integerring of integers of quadratic field
Analysis of algorithms and problem complexity (68Q25) Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Quadratic extensions (11R11) Units and factorization (11R27) Software, source code, etc. for problems pertaining to field theory (12-04)
Recommendations
Cited in
(17)- Automata, Languages and Programming
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- Shortest division chains in unique factorization domains
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
- Algorithmic Number Theory
- Shortest division chains in imaginary quadratic number fields
- The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields
- Basic algorithms in number theory
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- Unique factorization in Cayley arithmetics and cryptology
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
- Unique factorization and the fundamental theorem of arithmetic
- On the minimal algorithm in rings of imaginary quadratic integers
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
- scientific article; zbMATH DE number 3219005 (Why is no real title available?)
- On the greatest common divisor in imaginary quadratic fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728091)
