The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 721 – 740 of 1970

Showing per page

A polynomial reduction algorithm

Henri Cohen, Francisco Diaz Y Diaz (1991)

Journal de théorie des nombres de Bordeaux

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 / . Our algorithm uses the L L L algorithm to find a basis of minimal vectors for the lattice of n determined by the integers of K under the canonical map.

Currently displaying 721 – 740 of 1970