Algorithms for factoring polynomials over finite fields

MaRDI QIDQ2712122zbMATH OpenFDO

Authors Tanja Lange, Arne Winterhof

Publication date 6 May 2001

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Factoring polynomials over arbitrary finite fields
• scientific article; zbMATH DE number 1263216
• scientific article; zbMATH DE number 3880116
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials over finite fields

Cited in

(17)

• Algorithms for adaptive factorization of polynomials
• Factoring polynomials over arbitrary finite fields
• A new efficient factorization algorithm for polynomials over small finite fields
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
• Factoring polynomials over finite fields and stable colorings of tournaments
• A remark on factorisation
• A New Algorithm for Factoring Polynomials Over Finite Fields
• scientific article; zbMATH DE number 1273636 (Why is no real title available?)
• On a New Factorization Algorithm for Polynomials Over Finite Fields
• Factoring polynomials using binary representations of finite fields
• Algorithms for polynomial GCD computation over algebraic function fields
• scientific article; zbMATH DE number 2162228 (Why is no real title available?)
• Factoring polynomials over finite fields using balance test
• scientific article; zbMATH DE number 6308159 (Why is no real title available?)
• Practical polynomial factoring in polynomial time
• Factoring: algorithms, computations, and computers
• Univariate polynomial factorization over finite fields with large extension degree

This page was built for publication: Algorithms for factoring polynomials over finite fields

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