On square-free factorization of multivariate polynomials over a finite field.

DOI10.1016/S0304-3975(97)00059-5zbMath1036.11524MaRDI QIDQ1389623

Laurent Bernardin

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Finite fieldMultivariate polynomialSquare-free factorization

Mathematics Subject Classification ID

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

Related Items (3)

Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Fast separable factorization and applications ⋮ Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain

Uses Software

• AXIOM
• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Square-free algorithms in positive characteristic

This page was built for publication: On square-free factorization of multivariate polynomials over a finite field.