Univariate polynomial factorization over finite fields with large extension degree
From MaRDI portal
Publication:6122401
DOI10.1007/s00200-021-00536-1WikidataQ114231186 ScholiaQ114231186MaRDI QIDQ6122401
Joris van der Hoeven, Grégoire Lecerf
Publication date: 1 March 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Polynomials over finite fields (11T06) Divisibility and factorizations in commutative rings (13A05) Computer science (68-XX) Group theory and generalizations (20-XX) Associative rings and algebras (16-XX)
Cites Work
- Modular composition modulo triangular sets and applications
- Modular composition via factorization
- A new polynomial factorization algorithm and its implementation
- Fast amortized multi-point evaluation
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Fast multivariate multi-point evaluation revisited
- Accelerated tower arithmetic
- Computing Frobenius maps and factoring polynomials
- Fast separable factorization and applications
- Boolean circuits versus arithmetic circuits
- The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
- Handbook of Finite Fields
- Modern Computer Algebra
- Fast Polynomial Factorization and Modular Composition
- Probabilistic Algorithms in Finite Fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Subquadratic-time factoring of polynomials over finite fields
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Factoring Polynomials Over Large Finite Fields
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Fast construction of irreducible polynomials over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
