Deterministic root finding in finite fields
From MaRDI portal
Recommendations
- Subgroup Refinement Algorithms for Root Finding in GF(q)
- Deterministic root finding over finite fields using Graeffe transforms
- A geometric approach to root finding in GT(q/sup m/)
- Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
- scientific article; zbMATH DE number 4065121
Cites work
- A geometric approach to root finding in GT(q/sup m/)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Factoring Polynomials Over Large Finite Fields
- scientific article; zbMATH DE number 6488188 (Why is no real title available?)
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- On the Efficiency of Algorithms for Polynomial Factoring
- Subgroup Refinement Algorithms for Root Finding in GF(q)
Cited in
(7)- Numerical root finding via Cox rings
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
- Deterministic root finding over finite fields using Graeffe transforms
- scientific article; zbMATH DE number 4065121 (Why is no real title available?)
- Subgroup Refinement Algorithms for Root Finding in GF(q)
- A generalized successive resultants algorithm
- Character sums and deterministic polynomial root finding in finite fields
This page was built for publication: Deterministic root finding in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270175)
