scientific article

zbMath0541.68018MaRDI QIDQ3327715

Arjen K. Lenstra

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integral latticebasis reduction algorithmshort vectorsfactorization of polynomials over algebraic number fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials (irreducibility, etc.) (11R09) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (10)

A relative van Hoeij algorithm over number fields ⋮ Polynomial factorization algorithms over number fields ⋮ On the normalization of numbers and functions defined by radicals ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Newton polygons of higher order in algebraic number theory ⋮ Factoring polynomials over global fields. I ⋮ Optimal algorithm for algebraic factoring ⋮ Algebraic factoring and geometry theorem proving ⋮ On the smallest ratio problem of lattice bases ⋮ Factoring polynomials over global fields

This page was built for publication: