Subexponential algorithms for class group and unit computations
From MaRDI portal
Recommendations
Cited in
(30)- A fast, rigorous technique for computing the regulator of a real quadratic field
- Solving Thue equations without the full unit group
- scientific article; zbMATH DE number 2086881 (Why is no real title available?)
- Computing the multiplicative group of residue class rings
- On ideal class group computation of imaginary multiquadratic fields
- Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields
- Pseudo-random walk on ideals: practical speed-up in relation collection for class group computation
- 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
- On computing subfields. A detailed description of the algorithm
- Valuations of \(p\)-adic regulators of cyclic cubic fields
- Algorithmic Number Theory
- 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
- Subexponential time relations in the class group of large degree number fields
- scientific article; zbMATH DE number 1113849 (Why is no real title available?)
- Selected applications of LLL in number theory
- The anisotropic part of a quadratic form over a number field
- scientific article; zbMATH DE number 733559 (Why is no real title available?)
- 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
- Computing \(e\)-th roots in 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)
