Subexponential algorithms for class group and unit computations
DOI10.1006/JSCO.1996.0143zbMATH Open0880.68067OpenAlexW2036532467MaRDI QIDQ1369801FDOQ1369801
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
Recommendations
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)
Cited In (26)
- A fast, rigorous technique for computing the regulator of a real quadratic field
- Solving Thue equations without the full unit group
- Title not available (Why is that?)
- On ideal class group computation of imaginary multiquadratic fields
- Computing the multiplicative group of residue class rings
- Topics in computational algebraic number theory
- Computing endomorphism rings of abelian varieties of dimension two
- 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
- Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
- An algorithm for solving the principal ideal problem with subfields
- Algorithmic Number Theory
- On computing subfields. A detailed description of the algorithm
- Valuations of \(p\)-adic regulators of cyclic cubic fields
- Subexponential class group and unit group computation in large degree number fields
- InfoMod: a visual and computational approach to Gauss' binary quadratic forms
- An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field
- Selected applications of LLL in number theory
- Title not available (Why is that?)
- The anisotropic part of a quadratic form over a number field
- Title not available (Why is that?)
- A survey of computational class field theory
- Improvements in the computation of ideal class groups of imaginary quadratic number fields
- Class field theory, Diophantine analysis and the asymptotic Fermat's last theorem
- Evaluation of strategic risks of credit processes in the banking system of Iran
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
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)
