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 ...

Polynomial equations are a cornerstone of modern science, providing a mathematical basis for celestial mechanics, computer graphics, market growth predictions and much more. But although most high ...

We consider the a posteriori error analysis of approximations of parabolic problems based on arbitrarily high-order conforming Galerkin spatial discretizations and ...