An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
From MaRDI portal
Publication:5418498
DOI10.1090/S0025-5718-2014-02651-3zbMath1346.11065OpenAlexW2096556656MaRDI QIDQ5418498
Publication date: 4 June 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02651-3
Units and factorization (11R27) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)
Related Items (7)
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 ⋮ Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Subexponential time relations in the class group of large degree number fields ⋮ Subexponential class group and unit group computation in large degree number fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the Pell equation
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the complexity of computing determinants
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Computing residue class rings and Picard groups of orders
- Approximate formulas for some functions of prime numbers
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Explicit Bounds for Primality Testing and Related Problems
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- An Inequality About Factors of Polynomials
- Fast Multiple-Precision Evaluation of Elementary Functions
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction
- Dependency of units in number fields
This page was built for publication: An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
