Polynomial factorisation: an exploration of Lenstra's algorithm

DOI10.1007/3-540-51517-8_144MaRDI QIDQ5393368zbMATH OpenOpenAlexFDO

Authors John Abbott, James H. Davenport

Publication date 16 April 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51517-8_144

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Polynomials, factorization in commutative rings (13P05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 4165010
• scientific article; zbMATH DE number 3906595
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3909733
• scientific article; zbMATH DE number 922258

Cited in

(3)

• scientific article; zbMATH DE number 6500356 (Why is no real title available?)
• An efficient algorithm for factoring polynomials over algebraic extension field
• scientific article; zbMATH DE number 4006369 (Why is no real title available?)

This page was built for publication: Polynomial factorisation: an exploration of Lenstra's algorithm

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