Deterministic root finding over finite fields using Graeffe transforms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4065121 (Why is no real title available?)
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151173 (Why is no real title available?)
- scientific article; zbMATH DE number 799779 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
- A Gröbner free alternative for polynomial system solving
- A New Algorithm for Factoring Polynomials Over Finite Fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Comments on search procedures for primitive roots
- Deterministic polynomial factoring and association schemes
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Even faster integer multiplication
- Extracting sparse factors from multivariate integral polynomials
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials and primitive elements for special primes
- Factoring polynomials modulo special primes
- Factoring polynomials over finite fields using balance test
- Factoring polynomials over finite fields: A survey
- Fast computation of special resultants
- Fast polynomial factorization and modular composition
- Fast separable factorization and applications
- Faster deterministic integer factorization
- Galois Groups and Factoring Polynomials over Finite Fields
- Generalized riemann hypothesis and factoring polynomials over finite fields
- Handbook of finite fields
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- New techniques for the computation of linear recurrence coefficients
- On fast multiplication of polynomials over arbitrary algebras
- On the Efficiency of Algorithms for Polynomial Factoring
- On the deterministic complexity of factoring polynomials
- On the deterministic complexity of factoring polynomials over finite fields
- Polynomial evaluation and interpolation on special sets of points
- Probabilistic Algorithms in Finite Fields
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Searching for Primitive Roots in Finite Fields
- Smoothness and factoring polynomials over finite fields
- Solving a Polynomial Equation: Some History and Recent Progress
- Subgroup Refinement Algorithms for Root Finding in $GF(q)$
- Tangent Graeffe iteration
- Tracking \(p\)-adic precision
- Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
Cited in
(20)- A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
- Implementing the tangent Graeffe root finding method
- On the complexity of the Lickteig-Roy subresultant algorithm
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Computing one billion roots using the tangent Graeffe method
- Root-Squaring for Root-Finding
- Counting roots for polynomials modulo prime powers
- Accelerated tower arithmetic
- Subgroup Refinement Algorithms for Root Finding in $GF(q)$
- On the computation of rational solutions of underdetermined systems over a finite field
- Character sums and deterministic polynomial root finding in finite fields
- Computing Riemann-Roch spaces via Puiseux expansions
- Modular composition via factorization
- A geometric approach to root finding in GT(q/sup m/)
- Deterministic root finding in finite fields
- A generalized successive resultants algorithm
- scientific article; zbMATH DE number 4065121 (Why is no real title available?)
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- On the complexity exponent of polynomial system solving
- Fast computation of generic bivariate resultants
This page was built for publication: Deterministic root finding over finite fields using Graeffe transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300881)
