Factorization of multivariate positive Laurent polynomials
โ Scribed by Jeffrey S. Geronimo; Ming-Jun Lai
- Book ID
- 108158992
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 217 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we present a new deterministic algorithm for computing the square-free decomposition of multivariate polynomials with coefficients from a finite field. Our algorithm is based on Yun's square-free factorization algorithm for characteristic 0. The new algorithm is more efficient than ex
The ring of polynomials in \(X, X_{1}, \ldots, X_{m}\) are denoted by \(\mathbf{F}_{p}\left[X, X_{1}, \ldots, X_{m}\right]\) in \(F_{p}\), that is the field of integers defined modulo \(p\). In the usual factorization algorithm defined by Wang, the given polynomial \(P\) is first factorized modulo \