Module poly_gcd 

Contains poly_gcd::PolyTFracGCDRing for rings over which we can compute polynomial gcds and related operations, modulo multiplication by non-zero divisors.

Modules

finite

Contains an implementation of factoring polynomials over finite fields.

gcd

Contains algorithms for computing the gcd of polynomials.

hensel

Contains an implementation of Hensel lifting, to lift a factorization modulo a maximal ideal to a factorization modulo a power of this ideal.

squarefree_part

Contains algorithms for computing power decompositions and the square-free part of polynomials.

Traits

PolyTFracGCDRing

Trait for domain R for which there is an efficient way of computing the gcd of univariate polynomials over TFrac(R), where TFrac(R) is the total ring of fractions.

Functions

evaluate_aXunstable-enable

Computes the map

make_primitiveunstable-enable

Given a polynomial f over a PID, returns (f/cont(f), cont(f)), where cont(f) is the content of f, i.e. the gcd of all coefficients of f.

poly_rootunstable-enable

Checks whether there exists a polynomial g such that g^k = f, and if yes, returns g.

unevaluate_aXunstable-enable

Computes the inverse to evaluate_aX().