scientific article; zbMATH DE number 3880116

MaRDI QIDQ3345783zbMATH OpenFDO

Authors D. Lazard

Publication date 1982

zbMATH Keywords

algorithms for factoring univariate polynomials over finite fieldsaverage complexityprimitive idempotentsprobabilistic algorithm

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 922258
• A new polynomial factorization algorithm and its implementation
• scientific article; zbMATH DE number 1253982
• On the deterministic complexity of factoring polynomials over finite fields
• Univariate polynomial factorization over finite fields

Cited in

(38)

• Univariate polynomial factorization over finite fields
• Factoring modular polynomials
• Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
• A generalisation of the Cantor-Zassenhaus algorithm
• Factorisation patterns of division polynomials
• A new polynomial factorization algorithm and its implementation
• Interval partitions and polynomial factorization
• scientific article; zbMATH DE number 1594303 (Why is no real title available?)
• Improvements on the Cantor-Zassenhaus factorization algorithm.
• Computing all factorizations in \(\mathbb{Z}_N[x]\)
• Absolute Factorization of Polynomials: A Geometric Approach
• scientific article; zbMATH DE number 3872677 (Why is no real title available?)
• scientific article; zbMATH DE number 5605452 (Why is no real title available?)
• scientific article; zbMATH DE number 4145747 (Why is no real title available?)
• Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme
• scientific article; zbMATH DE number 4165010 (Why is no real title available?)
• scientific article; zbMATH DE number 4002212 (Why is no real title available?)
• scientific article; zbMATH DE number 4069025 (Why is no real title available?)
• scientific article; zbMATH DE number 15339 (Why is no real title available?)
• On Grau’s Method for Simultaneous Factorization of Polynomials
• scientific article; zbMATH DE number 1253982 (Why is no real title available?)
• Subquadratic-time factoring of polynomials over finite fields
• scientific article; zbMATH DE number 2070370 (Why is no real title available?)
• Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
• Factoring into coprimes in essentially linear time
• Factoring polynomials via polytopes
• scientific article; zbMATH DE number 2151340 (Why is no real title available?)
• scientific article; zbMATH DE number 6964047 (Why is no real title available?)
• Factoring a binary polynomial of degree over one million
• scientific article; zbMATH DE number 922258 (Why is no real title available?)
• On the factors of a polynomial
• Factoring polynomials over finite fields: A survey
• Univariate polynomial factorization over finite fields with large extension degree
• On tries, contention trees and their analysis
• Toward a theory of Pollard's rho method
• On the factorization of Eulerian polynomials
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials using fewer random bits

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 Q3345783)