scientific article; zbMATH DE number 3880116

MaRDI QIDQ3345783zbMATH OpenFDO

Authors D. Lazard

Publication date 1982

zbMATH Keywords

probabilistic algorithmprimitive idempotentsaverage complexityalgorithms for factoring univariate polynomials over finite fields

Mathematics Subject Classification ID

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

Recommendations

• Publication:4892927
• 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

(35)

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

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)