Two efficient algorithms for the computation of ideal sums in quadratic orders

DOI10.1090/S0025-5718-05-01799-0zbMath1158.11353MaRDI QIDQ3377005

Weilert, André

Publication date: 27 March 2006

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Quadratic extensions (11R11) Algebraic number theory computations (11Y40) Algebraic numbers; rings of algebraic integers (11R04)

Cites Work

• A fast Euclidean algorithm for Gaussian integers
• Fast computation of the biquadratic residue symbol.
• The Euclidean algorithm in algebraic number fields
• Computational problems associated with Racah algebra
• Fast multiplication of large numbers
• Fast computation of continued fraction expansions.
• Asymptotically Fast Triangularization of Matrices over Rings
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• Analytic Number Theory
• Hermite and Smith normal form algorithms over Dedekind domains
• Advanced Topics in Computional Number Theory
• Algorithmic Number Theory
• Euclid's Algorithm for Large Numbers
• On the Zeta-Functions of Algebraic Number Fields
• On the Zeta-Functions of Algebraic Number Fields II
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two efficient algorithms for the computation of ideal sums in quadratic orders