Mathematics of Computation, Vol. 45, No. 171 (Jul., 1985), pp. 251-261 (11 pages) We present a probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients ...

A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...

Matrix polynomials and moment problems are significant areas of study in mathematics, particularly in the fields of control theory, numerical analysis, and probability. Matrix polynomials are ...