A Terr algorithm for computations in the infrastructure of real-quadratic number fields
From MaRDI portal
Publication:2642773
DOI10.5802/JTNB.558zbMATH Open1132.11055OpenAlexW2317387647MaRDI QIDQ2642773FDOQ2642773
Authors: Ulrich Vollmer, Johannes 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Binary quadratic forms. An algorithmic approach
- Computing Arakelov class groups
- On the Infrastructure of the Principal Ideal Class of an Algebraic Number Field of Unit Rank One
- Title not available (Why is that?)
- Explicit Bounds for Primality Testing and Related Problems
- On some computational problems in finite abelian groups
- Computing the structure of a finite abelian group
- Title not available (Why is that?)
- A modification of Shanks' baby-step giant-step algorithm
Cited In (3)
This page was built for publication: A Terr algorithm for computations in the infrastructure of real-quadratic number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642773)