scientific article; zbMATH DE number 4065121

MaRDI QIDQ3798759zbMATH OpenFDO

Authors Maurice Mignotte, Claus Peter Schnorr

Publication date 1988

zbMATH Keywords

deterministic algorithmroots of polynomials over the finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
• Deterministic root finding over finite fields using Graeffe transforms
• Deterministic root finding in finite fields
• Efficient computation of roots in finite fields
• On a New Factorization Algorithm for Polynomials Over Finite Fields

Cited in

(12)

• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
• Univariate polynomial factorization over finite fields
• Efficient computation of roots in finite fields
• Sublinear root detection and new hardness results for sparse polynomials over finite fields
• Deterministic root finding over finite fields using Graeffe transforms
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• scientific article; zbMATH DE number 1222350 (Why is no real title available?)
• Deterministic root finding in finite fields
• Character sums and deterministic polynomial root finding in finite fields
• Factoring polynomials over special finite fields
• Factoring polynomials over finite fields: A survey
• On the deterministic complexity of factoring polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798759)