Efficient multivariate factorization over finite fields
From MaRDI portal
Recommendations
- Factoring multivariate polynomials over finite fields
- Univariate polynomial factorization over finite fields
- Factorization of Multivariate Polynomials Over Finite Fields
- On square-free factorization of multivariate polynomials over a finite field.
- On factorization of multivariate polynomials over algebraic number and function fields
Cited in
(9)- Probabilistic absolute irreducibility test for polynomials
- Bivariate factorization using a critical fiber
- Fast separable factorization and applications
- 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
- High performance implementation of factoring multivariate polynomials based on NTL
- scientific article; zbMATH DE number 3897063 (Why is no real title available?)
- Efficient Factoring Based on Partial Information
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
This page was built for publication: Efficient multivariate factorization over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470456)