scientific article; zbMATH DE number 3959562
zbMATH Open0596.12001MaRDI QIDQ3728091FDOQ3728091
Authors: Erich L. Kaltofen, Heinrich Rolletschek 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (16)
- The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields
- Shortest division chains in unique factorization domains
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
- Basic algorithms in number theory
- On the number of divisions of the Euclidean algorithm applied to Gaussian integers
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- On the minimal algorithm in rings of imaginary quadratic integers
- Automata, Languages and Programming
- Shortest division chains in imaginary quadratic number fields
- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
- Unique factorization and the fundamental theorem of arithmetic
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Title not available (Why is that?)
- Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
- Unique factorization in Cayley arithmetics and cryptology
- Algorithmic Number Theory
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)
