Pages that link to "Item:Q365855"

The following pages link to An efficient algorithm for factoring polynomials over algebraic extension field (Q365855):

Displaying 11 items.

• Algorithms for adaptive factorization of polynomials (Q1314605) (← links)
• Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
• A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
• Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis (Q2392952) (← links)
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
• (Q3356418) (← links)
• An algorithm for polynomial multiplication that does not depend on the ring constants (Q3792774) (← links)
• A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477) (← links)
• (Q4237366) (← links)
• On a New Factorization Algorithm for Polynomials Over Finite Fields (Q4325734) (← links)
• USING GRÖBNER BASES FOR FACTORING POLYNOMIALS OVER ALGEBRAIC EXTENSION FIELDS (Q5389511) (← links)