A Terr algorithm for computations in the infrastructure of real-quadratic number fields

DOI10.5802/jtnb.558zbMath1132.11055OpenAlexW2317387647MaRDI QIDQ2642773

Ulrich Vollmer, Johannes A. Buchmann

Publication date: 4 September 2007

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2006__18_3_559_0

zbMATH Keywords

real quadratic fieldsinfrastructureTerr algorithm

Mathematics Subject Classification ID

Quadratic extensions (11R11) Algebraic number theory computations (11Y40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary quadratic forms. An algorithmic approach
• Explicit Bounds for Primality Testing and Related Problems
• Computing Arakelov class groups
• On the Infrastructure of the Principal Ideal Class of an Algebraic Number Field of Unit Rank One
• On some computational problems in finite abelian groups
• A modification of Shanks' baby-step giant-step algorithm
• Computing the structure of a finite abelian group

This page was built for publication: A Terr algorithm for computations in the infrastructure of real-quadratic number fields