On square-free factorization of multivariate polynomials over a finite field.
From MaRDI portal
Publication:1389623
DOI10.1016/S0304-3975(97)00059-5zbMATH Open1036.11524MaRDI QIDQ1389623FDOQ1389623
Authors: Laurent Bernardin 
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Factorization of Multivariate Polynomials Over Finite Fields
- Factoring multivariate polynomials over finite fields
- On factorization of multivariate polynomials over algebraic number and function fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- scientific article; zbMATH DE number 3906595
- On Bivariate Polynomial Factorization over Finite Fields
- Factoring Multivariate Polynomials over Large Finite Fields
- Factoring polynomials over finite fields: A survey
- Polynomials over finite fields free from large and small degree irreducible factors
- Factorization of polynomials and some linear-algebra problems over finite fields
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
Cited In (8)
- Fast modular algorithms for squarefree factorization and Hermite integration
- Title not available (Why is that?)
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- Title not available (Why is that?)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Fast separable factorization and applications
- Square-free criteria for polynomials using no derivatives
- Efficient computation of squarefree separator polynomials
Uses Software
This page was built for publication: On square-free factorization of multivariate polynomials over a finite field.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389623)
