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

A new technical paper titled “Computing high-degree polynomial gradients in memory” was published by researchers at UCSB, HP Labs, Forschungszentrum Juelich GmbH, and RWTH Aachen University.

Let R be a local, Noetherian ring and I ⊆ R an ideal. A question of Kodiyalam asks whether for fixed i > 0, the polynomial giving the ith Betti number of $I^{n ...