Algorithms in Algebraic Number Theory
type: Item
instance of: scholarly article
title: Algorithms in Algebraic Number Theory
zbMATH Open document ID: 0759.11046
DOI: 10.1090/S0273-0979-1992-00284-7
author: H. W. jun. Lenstra
published in: Bulletin of the American Mathematical Society
publication date: 1992-09-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/9204234
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11Y40
Mathematics Subject Classification ID: 11-02
zbMATH DE Number: 57135
zbMATH Keywords: unit groups
zbMATH Keywords: algorithmic algebraic number theory
zbMATH Keywords: determination of Galois groups
zbMATH Keywords: ring of integers
zbMATH Keywords: class groups
zbMATH Keywords: complexity
zbMATH Keywords: algorithms
zbMATH Keywords: survey
MaRDI profile type: Publication
arXiv ID: math/9204234
cites work: On distinguishing prime numbers from composite numbers
cites work: Q3786463
cites work: Elliptic Curves and Primality Proving
cites work: Explicit Bounds for Primality Testing and Related Problems
cites work: Q3138894
cites work: Q3361884
cites work: Q4745933
cites work: Q3197949
cites work: Constructing nonresidues in finite fields and the extended Riemann hypothesis
cites work: On the Computation of the Class Number of an Algebraic Number Field
cites work: Q4273681
cites work: Finite Permutation Groups and Finite Simple Groups
cites work: Q3726220
cites work: Q3775643
cites work: Q3139838
cites work: Implementation of a new primality test
cites work: Primality Testing and Jacobi Sums
cites work: Q3835552
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: A Rigorous Subexponential Algorithm For Computation of Class Groups
cites work: Asymptotically Fast Triangularization of Matrices over Rings
cites work: Q3935355
cites work: Q3698311
cites work: Factoring Polynomials over Algebraic Number Fields
cites work: Solvability by radicals is in polynomial time
cites work: Q5612629
cites work: Q3326837
cites work: Factoring Multivariate Polynomials over Algebraic Number Fields
cites work: Q4385516
cites work: Factoring polynomials with rational coefficients
cites work: The Factorization of the Ninth Fermat Number
cites work: An asymptotic formula for the Bergman projection on a certain class of domains in \({\mathbb{C}}\)
cites work: Finding Isomorphisms Between Finite Fields
cites work: A Rigorous Time Bound for Factoring Integers
cites work: ENUMERATING FINITE GROUPS
cites work: Q3726006
cites work: A polynomial bound for the orders of primitive solvable groups
cites work: Q3469191
cites work: Q4692759
cites work: Q3808150
cites work: Q3476903
cites work: Generalization of a theorem of Siegel
cites work: Discrete logarithms and local units
cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
cites work: Q4148144
cites work: Q3992577
cites work: Q4099715
cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields
cites work: On the deterministic complexity of factoring polynomials over finite fields
cites work: Q5580395
cites work: The Determination of Galois Groups
cites work: Current Trends in Arithmetical Algebraic Geometry
cites work: The Computational Complexity of the Resolution of Plane Curve Singularities
cites work: Q4285667
cites work: Q4748224
cites work: Q4746785
cites work: Q5723265

Algorithms in Algebraic Number Theory (cites work)
cites work: Q5534341

Algorithms in Algebraic Number Theory (cites work)
cites work: Computational problems, methods, and results in algebraic number theory

Algorithms in Algebraic Number Theory (OpenAlex ID)
OpenAlex ID: W1996266453