Poly1 p-adic. More...
|Rep &||setdegree (Rep &P) const|
|Compute the degree of P. More...|
|size_t &||sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const|
|Sqrfree decomposition. More...|
Compute the degree of P.
Decompose P such that: P = Fact^0 * Fact^1 * ... * Fact[P.degree()]^(P.degree()), with Fact the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.
|Nfact||[in] the size of Fact|
|Fact||[in] an array of dimension Nfact|
|Nfact||[out] is the number of factor in the sqrfree decomposition|
|Fact||[out] contains at most Nfact factors of the decomposition.|