Algorithms in Algebraic Number Theory

DOI10.1090/S0273-0979-1992-00284-7zbMath0759.11046arXivmath/9204234OpenAlexW1996266453MaRDI QIDQ4005808

Publication date: 27 September 1992

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9204234

zbMATH Keywords

survey complexity algorithms class groups unit groups ring of integers algorithmic algebraic number theory determination of Galois groups

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Algebraic number theory computations (11Y40)

Related Items

Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ Explicit bound of the divisor function ⋮ Odd values of the Ramanujan tau function ⋮ Counting integral ideals in a number field ⋮ Computing points of bounded height in projective space over a number field ⋮ On reduced Arakelov divisors of real quadratic fields ⋮ Nonnegative Weighted #CSP: An Effective Complexity Dichotomy ⋮ Bounds for computing the tame kernel ⋮ An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank ⋮ On the convergence of arithmetic orbifolds ⋮ Black box Galois representations ⋮ Commensurability in Mordell-Weil groups of abelian varieties and tori ⋮ Well-rounded twists of ideal lattices from imaginary quadratic fields ⋮ Curves over every global field violating the local-global principle ⋮ A dichotomy for bounded degree graph homomorphisms with nonnegative weights ⋮ Computing the Conley Index: A Cautionary Tale ⋮ Computing the endomorphism ring of an ordinary abelian surface over a finite field ⋮ On the computation of overorders ⋮ Norm relations and computational problems in number fields ⋮ The 𝐴𝐵𝐶-Conjecture implies uniform bounds on dynamical Zsigmondy sets ⋮ Constructing nonresidues in finite fields and the extended Riemann hypothesis ⋮ Finiteness of Hilbert eigenform product identities ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ On the computation of the endomorphism rings of abelian surfaces ⋮ Two explicit divisor sums ⋮ S-INTEGRAL POINTS ON HYPERELLIPTIC CURVES ⋮ Rigorous analysis of a randomised number field sieve ⋮ List decoding of number field codes ⋮ Factoring polynomials over special finite fields ⋮ Explicit bounds for residues of Dedekind zeta functions, values of \(L\)-functions at \(s=1\), and relative class numbers ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Determinants of subquotients of Galois representations associated with abelian varieties ⋮ Recognizing Units in Number Fields ⋮ Computing local integral closures ⋮ Using number fields to compute logarithms in finite fields ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Approximating rings of integers in number fields ⋮ Solvability of norm equations over cyclic number fields of prime degree ⋮ Almost powers in the Lucas sequence ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ \(\sqrt{2}+\sqrt{3}\): Four different views ⋮ A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights ⋮ Hyperalgebraic primitive elements for relational algebraic and topological algebraic models ⋮ Computing algebraic numbers of bounded height ⋮ Applications of Algebra for Some Game Theoretic Problems ⋮ Computing local Artin maps, and solvability of norm equations ⋮ Bounds for global coefficients in the fine geometric expansion of Arthur's trace formula for GL(\(n\)) ⋮ A Reduction of Integer Factorization to Modular Tetration ⋮ An effective proof of the hyperelliptic Shafarevich conjecture ⋮ A note on locality of algebras ⋮ Linear differential operators for polynomial equations ⋮ Computing automorphisms of abelian number fields ⋮ Local to global principle for semiabelian varieties isogenous to the product of an abelian variety and a torus

Cites Work