Lattices and factorization of polynomials

DOI10.1145/1089263.1089265zbMath0477.12002OpenAlexW2074940796MaRDI QIDQ3932892

Arjen K. Lenstra

Publication date: 1981

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/149496/files/149496.pdf

zbMATH Keywords

basis reductionalgorithm for the factorization of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05) Lattices and convex bodies (number-theoretic aspects) (11H06) Polynomials (irreducibility, etc.) (11R09) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (4)

On Lovász' lattice reduction and the nearest lattice point problem ⋮ Computer algebra: Past and future ⋮ Hardness of approximating the closest vector problem with pre-processing ⋮ Factoring polynomials with rational coefficients

This page was built for publication: Lattices and factorization of polynomials