Pages that link to "Item:Q3955477"
From MaRDI portal
The following pages link to A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477):
Displayed 40 items.
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Computer construction of split Cartan subalgebras (Q875096) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Iterative root approximation in \(p\)-adic numerical analysis (Q1049397) (← links)
- Algebraic algorithms in GF(q) (Q1066670) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Towards a soluble quotient algorithm (Q1097350) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315) (← links)
- Short presentations for finite groups (Q1365014) (← links)
- A generalisation of the Cantor-Zassenhaus algorithm (Q1377270) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Are fifth-degree equations over \(GF(5^ m)\) solvable by radicals? (Q1908900) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields (Q2719077) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
- A Highly Scalable RFID Authentication Protocol (Q3634505) (← 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)
- Factoring polynomials over finite fields with Drinfeld modules (Q4433134) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- Distinct Degree Factorizations for Polynomials over a Finite Field (Q4846077) (← links)
- On Bivariate Polynomial Factorization over Finite Fields (Q5288235) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Factoring polynomials over local fields. (Q5950986) (← links)