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

DOI10.1090/S0025-5718-05-01799-0zbMATH Open1158.11353MaRDI QIDQ3377005FDOQ3377005

Weilert, André

Publication date: 27 March 2006

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)