Pages that link to "Item:Q2366271"

The following pages link to A new efficient factorization algorithm for polynomials over small finite fields (Q2366271):

Displaying 13 items.

• A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315) (← links)
• Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
• A note on the factorization method of Niederreiter (Q1779329) (← links)
• Subspaces and polynomial factorizations over finite fields (Q1842604) (← links)
• Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
• Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\) (Q2580254) (← links)
• Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
• Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)