Lattices and factorization of polynomials

DOI10.1145/1089263.1089265MaRDI QIDQ3932892zbMATH OpenOpenAlexFDO

Authors 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

algorithm for the factorization of polynomialsbasis reduction

Mathematics Subject Classification ID

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

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932892)