scientific article; zbMATH DE number 922258

MaRDI QIDQ4892927zbMATH OpenFDO

Authors Vilmar Trevisan

Publication date 3 August 1997

zbMATH Keywords

algorithms for univariant polynomial factorizationBerlekamp's algorithmCantor-Zassenhaus algorithmdistinct degree factorizationLLL algorithmuniform degree factorization

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Factorization (11Y05) Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1276815
• A new polynomial factorization algorithm and its implementation
• scientific article; zbMATH DE number 3880116
• Univariate polynomial factorization over finite fields
• scientific article; zbMATH DE number 3909733

Cited in

(38)

• On polynomial factorization
• Univariate polynomial factorization over finite fields
• Factoring modular polynomials
• Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
• 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
• A note on Gröbner bases and Berlekamp's algorithm
• Improvements on the Cantor-Zassenhaus factorization algorithm.
• Computing all factorizations in \(\mathbb{Z}_N[x]\)
• scientific article; zbMATH DE number 1799292 (Why is no real title available?)
• Factorization patterns of polynomials
• scientific article; zbMATH DE number 3860385 (Why is no real title available?)
• scientific article; zbMATH DE number 3872677 (Why is no real title available?)
• scientific article; zbMATH DE number 3880116 (Why is no real title available?)
• scientific article; zbMATH DE number 5605452 (Why is no real title available?)
• scientific article; zbMATH DE number 4146074 (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 3909733 (Why is no real title available?)
• scientific article; zbMATH DE number 3939455 (Why is no real title available?)
• scientific article; zbMATH DE number 4002212 (Why is no real title available?)
• scientific article; zbMATH DE number 4008513 (Why is no real title available?)
• scientific article; zbMATH DE number 15339 (Why is no real title available?)
• scientific article; zbMATH DE number 1276815 (Why is no real title available?)
• scientific article; zbMATH DE number 1960426 (Why is no real title available?)
• Factoring into coprimes in essentially linear time
• Factoring polynomials via polytopes
• scientific article; zbMATH DE number 799766 (Why is no real title available?)
• Efficiently factoring polynomials modulo \(p^4\)
• Polynomial factorisation: an exploration of Lenstra's algorithm
• Fast modular algorithms for squarefree factorization and Hermite integration
• Optimal algorithm for algebraic factoring
• Polynomial factorization: Sharp bounds, efficient algorithms
• Factoring polynomials modulo special primes
• Factoring polynomials using fewer random bits
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

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