Subexponential algorithms for class group and unit computations

DOI10.1006/JSCO.1996.0143MaRDI QIDQ1369801zbMATH OpenOpenAlexFDO

Authors Henri Cohen, Francisco Diaz y Diaz, Michel Olivier

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) Parallel algorithms in computer science (68W10) Units and factorization (11R27) Class numbers, class groups, discriminants (11R29) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• Subexponential class group and unit group computation in large degree number fields
• scientific article; zbMATH DE number 4200333
• scientific article; zbMATH DE number 16712
• Subexponential time relations in the class group of large degree number fields

Cited in

(28)

• scientific article; zbMATH DE number 733559 (Why is no real title available?)
• Topics in computational algebraic number theory
• scientific article; zbMATH DE number 2086881 (Why is no real title available?)
• An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
• Selected applications of LLL in number theory
• Computing endomorphism rings of abelian varieties of dimension two
• scientific article; zbMATH DE number 1113849 (Why is no real title available?)
• On ideal class group computation of imaginary multiquadratic fields
• Fast multiquadratic S-unit computation and application to the calculation of class groups
• Subexponential class group and unit group computation in large degree number fields
• Computing \(e\)-th roots in number fields
• Computing the multiplicative group of residue class rings
• A fast, rigorous technique for computing the regulator of a real quadratic field
• Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
• An algorithm for solving the principal ideal problem with subfields
• An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field
• InfoMod: a visual and computational approach to Gauss' binary quadratic forms
• Valuations of \(p\)-adic regulators of cyclic cubic fields
• Class field theory, Diophantine analysis and the asymptotic Fermat's last theorem
• Algorithmic Number Theory
• Solving Thue equations without the full unit group
• A survey of computational class field theory
• Subexponential time relations in the class group of large degree number fields
• Improvements in the computation of ideal class groups of imaginary quadratic number fields
• The anisotropic part of a quadratic form over a number field
• On computing subfields. A detailed description of the algorithm
• A proof of the conjectured run time of the Hafner-McCurley class group algorithm
• Evaluation of strategic risks of credit processes in the banking system of Iran

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369801)