scientific article; zbMATH DE number 1273637

zbMATH Open1019.11506MaRDI QIDQ4237367FDOQ4237367

Authors Vilmar Trevisan, Paul S. Wang 

Publication date 14 March 2000

zbMATH Keywords

hybrid algorithmfinite fieldfactorization of polynomialsBerlekamp algorithmCantor-Zassenhaus algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Computing Frobenius maps and factoring polynomials
• Univariate polynomial factorization over finite fields
• Factoring polynomials using binary representations of finite fields
• scientific article; zbMATH DE number 1254267
• Factorization of Multivariate Polynomials Over Finite Fields

Cited In (8)

• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Practical polynomial factoring in polynomial time
• A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
• Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
• Implementation of prime decomposition of polynomial ideals over small finite fields
• Univariate polynomial factorization over finite fields
• A lecture on the complexity of factoring polynomials over global fields
• Factoring polynomials using binary representations of finite fields

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