scientific article; zbMATH DE number 3880116

zbMATH Open0552.68048MaRDI QIDQ3345783FDOQ3345783

Authors: D. Lazard 

Publication date: 1982

Title of this publication is not available (Why is that?)

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

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)

Cited In (35)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Factorisation patterns of division polynomials
• Factoring polynomials using fewer random bits
• On the factors of a polynomial
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Interval partitions and polynomial factorization
• Factoring a binary polynomial of degree over one million
• Computing all factorizations in \(\mathbb{Z}_N[x]\)
• Title not available (Why is that?)
• Factoring into coprimes in essentially linear time
• Univariate polynomial factorization over finite fields
• Title not available (Why is that?)
• Factoring polynomials over finite fields: A survey
• Title not available (Why is that?)
• Toward a theory of Pollard's rho method
• Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Grau’s Method for Simultaneous Factorization of Polynomials
• Title not available (Why is that?)
• Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
• Subquadratic-time factoring of polynomials over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the factorization of Eulerian polynomials
• 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)