scientific article; zbMATH DE number 1276815

zbMATH Open0990.11081MaRDI QIDQ4238960

Frits Beukers

Publication date: 20 April 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmalgebraic number fieldHensel liftingfactoring polynomials over finite fieldsBerlekamp's algorithmLLL lattice reductionfactoring polynomials with integer coefficients

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08)

Related Items (9)

Modular Las Vegas algorithms for polynomial absolute factorization ⋮ On the factors of a polynomial ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Newton polygons of higher order in algebraic number theory ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Factoring polynomials via polytopes ⋮ Factorisation patterns of division polynomials ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

This page was built for publication:

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