A polynomial reduction algorithm

Cohen, Henri, and Diaz Y Diaz, Francisco. "A polynomial reduction algorithm." Journal de théorie des nombres de Bordeaux 3.2 (1991): 351-360. <http://eudml.org/doc/93544>.

@article{Cohen1991,
abstract = {The algorithm described in this paper is a practical approach to the problem of giving, for each number field $K$ a polynomial, as canonical as possible, a root of which is a primitive element of the extension $K/ \mathbb \{Q\}$. Our algorithm uses the $LLL$ algorithm to find a basis of minimal vectors for the lattice of $\mathbb \{R\}^n$ determined by the integers of $K$ under the canonical map.},
author = {Cohen, Henri, Diaz Y Diaz, Francisco},
journal = {Journal de théorie des nombres de Bordeaux},
keywords = {polynomial reduction algorithm; canonical elements for generating number fields; basis of minimal vectors; lattices; LLL-reduction},
language = {eng},
number = {2},
pages = {351-360},
publisher = {Université Bordeaux I},
title = {A polynomial reduction algorithm},
url = {http://eudml.org/doc/93544},
volume = {3},
year = {1991},
}

TY - JOUR
AU - Cohen, Henri
AU - Diaz Y Diaz, Francisco
TI - A polynomial reduction algorithm
JO - Journal de théorie des nombres de Bordeaux
PY - 1991
PB - Université Bordeaux I
VL - 3
IS - 2
SP - 351
EP - 360
AB - The algorithm described in this paper is a practical approach to the problem of giving, for each number field $K$ a polynomial, as canonical as possible, a root of which is a primitive element of the extension $K/ \mathbb {Q}$. Our algorithm uses the $LLL$ algorithm to find a basis of minimal vectors for the lattice of $\mathbb {R}^n$ determined by the integers of $K$ under the canonical map.
LA - eng
KW - polynomial reduction algorithm; canonical elements for generating number fields; basis of minimal vectors; lattices; LLL-reduction
UR - http://eudml.org/doc/93544
ER -