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

DOI10.1090/S0025-5718-05-01799-0MaRDI QIDQ3377005zbMATHFDO

Authors Weilert, André

Publication date 27 March 2006

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 733559
• scientific article; zbMATH DE number 1643955
• scientific article; zbMATH DE number 1643956
• Efficient ideal reduction in quadratic fields
• A New GCD Algorithm for Quadratic Number Rings with Unique Factorization

Cites work

• scientific article; zbMATH DE number 1643956 (Why is no real title available?)
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3119278 (Why is no real title available?)
• scientific article; zbMATH DE number 3815594 (Why is no real title available?)
• scientific article; zbMATH DE number 3959562 (Why is no real title available?)
• scientific article; zbMATH DE number 3728392 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 42967 (Why is no real title available?)
• scientific article; zbMATH DE number 45380 (Why is no real title available?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1273650 (Why is no real title available?)
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• scientific article; zbMATH DE number 641702 (Why is no real title available?)
• scientific article; zbMATH DE number 195204 (Why is no real title available?)
• scientific article; zbMATH DE number 3440002 (Why is no real title available?)
• scientific article; zbMATH DE number 784878 (Why is no real title available?)
• A fast Euclidean algorithm for Gaussian integers
• Advanced Topics in Computional Number Theory
• Algorithmic Number Theory
• Analytic Number Theory
• Asymptotically Fast Triangularization of Matrices over Rings
• Computational problems associated with Racah algebra
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• Euclid's Algorithm for Large Numbers
• Fast computation of continued fraction expansions.
• Fast computation of the biquadratic residue symbol.
• Fast multiplication of large numbers
• Hermite and Smith normal form algorithms over Dedekind domains
• Modern computer algebra
• On the Zeta-Functions of Algebraic Number Fields
• On the Zeta-Functions of Algebraic Number Fields II
• The Euclidean algorithm in algebraic number fields
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377005)