A polynomial reduction algorithm

DOI10.5802/jtnb.55zbMath0758.11053OpenAlexW2325626812MaRDI QIDQ4017063

Henri Cohen, Francisco Diaz y Diaz

Publication date: 16 January 1993

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1991__3_2_351_0

zbMATH Keywords

latticesLLL-reductionbasis of minimal vectorscanonical elements for generating number fieldspolynomial reduction algorithm

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40)

Related Items (13)

Tables of octic fields with a quartic subfield ⋮ Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ Block Systems of a Galois Group ⋮ Reducing number field defining polynomials: an application to class group computations ⋮ The complexity of computing all subfields of an algebraic number field ⋮ Computing ray class groups, conductors and discriminants ⋮ Topics in computational algebraic number theory ⋮ Selected Applications of LLL in Number Theory ⋮ Computing the Hilbert class field of real quadratic fields ⋮ A survey of computational class field theory ⋮ On computing subfields. A detailed description of the algorithm ⋮ Non-primitive number fields of degree eight and of signature (2,3), (4,2), and (6,1) with small discriminant

Cites Work

• Corps sextiques primitifs. (Primitive sextic fields)
• The construction of maximal orders over a Dedekind domain
• Factoring polynomials with rational coefficients
• The minimum discriminant of totally real octic fields
• Sur les corps résolubles de degré premier.
• The Determination of Galois Groups

This page was built for publication: A polynomial reduction algorithm