Module polynomial 

Modules

dense_multilinear_poly

sparse_multilinear_poly

Structs

Polynomial

Represents the polynomial c_0 + c_1 * X + c_2 * X^2 + … + c_n * X^n as a vector of coefficients [c_0, c_1, ... , c_n]

Enums

InterpolateError

Functions

compose

Computes the composition of polynomials P1(t) and P2(t), that is P1(P2(t)) It uses interpolation to determine the evaluation at points x_i and evaluates P1(P2(x[i])). The interpolation theorem ensures that we can reconstruct the polynomial uniquely by interpolation over a suitable number of points This is an inefficient version, for something more efficient, use FFT for evaluation, provided the field satisfies the necessary traits

pad_with_zero_coefficients

Pads polynomial representations with minimum number of zeros to match lengths.

pad_with_zero_coefficients_to_length

Pads a polynomial with zeros until the desired length This function can be useful when evaluating polynomials with the FFT