Pages that link to "Item:Q1322768"
From MaRDI portal
The following pages link to Factorization of polynomials over finite fields and characteristic sequences (Q1322768):
Displaying 19 items.
- On derivatives of polynomials over finite fields through integration (Q516828) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- The third-order factorable core of polynomials over finite fields (Q1130267) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Characterization and enumeration of good punctured polynomials over finite fields (Q1751477) (← links)
- A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
- Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter (Q2564910) (← links)
- Factorization of composite polynomials over finite fields (Q2862265) (← links)
- Chains of factorizations in orders of global fields (Q3122764) (← links)
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers (Q3800157) (← links)
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases (Q4292068) (← links)
- (Q4314373) (← links)
- On a New Factorization Algorithm for Polynomials Over Finite Fields (Q4325734) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
- (Q4555304) (← links)
- Factoring polynomials over special finite fields (Q5927536) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)