Subexponential algorithms for class group and unit computations

DOI10.1006/jsco.1996.0143zbMath0880.68067OpenAlexW2036532467MaRDI QIDQ1369801

Francisco Diaz y Diaz, Michel Olivier, Henri Cohen

Publication date: 25 November 1997

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

Full work available at URL: https://doi.org/10.1006/jsco.1996.0143

zbMATH Keywords

complex logarithmic embeddings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Units and factorization (11R27) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)

Related Items (15)

Evaluation of strategic risks of credit processes in the banking system of Iran ⋮ InfoMod: a visual and computational approach to Gauss' binary quadratic forms ⋮ The anisotropic part of a quadratic form over a number field ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ Topics in computational algebraic number theory ⋮ A fast, rigorous technique for computing the regulator of a real quadratic field ⋮ Selected Applications of LLL in Number Theory ⋮ Solving Thue equations without the full unit group ⋮ Valuations of \(p\)-adic regulators of cyclic cubic fields ⋮ Class field theory, Diophantine analysis and the asymptotic Fermat's last theorem ⋮ A survey of computational class field theory ⋮ Computing endomorphism rings of abelian varieties of dimension two ⋮ On ideal class group computation of imaginary multiquadratic fields ⋮ Subexponential class group and unit group computation in large degree number fields

This page was built for publication: Subexponential algorithms for class group and unit computations