On the computation of units and class numbers by a generalization of Lagrange's algorithm
Open Access
- 31 May 1987
- journal article
- Published by Elsevier in Journal of Number Theory
- Vol. 26 (1) , 8-30
- https://doi.org/10.1016/0022-314x(87)90092-8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic ConstantsMathematics of Computation, 1987
- The Computation of the Fundamental Unit of Totally Complex Quartic OrdersMathematics of Computation, 1987
- Continued fractions and number-theoretic computationsRocky Mountain Journal of Mathematics, 1985
- A generalization of Voronoi's unit algorithm IJournal of Number Theory, 1985
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985
- On totally real cubic fieldsMathematics of Computation, 1985
- Periodic expansion of modules and its relation to unitsJournal of Number Theory, 1982
- On effective computation of fundamental units. IMathematics of Computation, 1982
- Reduction theory in algebraic number fieldsBulletin of the American Mathematical Society, 1974
- Theorie der NetzeMathematische Annalen, 1963