|[ << ]||[ < ]||[ Up ]||[ > ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
In ‘fff’ square-free factorization, DDF (distinct degree factorization), irreducible factorization and primality check are implemented for univariate polynomials over finite fields.
Factorizers return lists of [factor,multiplicity]. The factor part is monic and the information on the leading coefficient of the input polynomial is abandoned.
The algorithm used in square-free factorization is the most primitive one.
The irreducible factorization proceeds as follows.
|[ << ]||[ < ]||[ Up ]||[ > ]||[ >> ]|
This document was generated on March 23, 2018 using texi2html 5.0.