Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...

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

As a goal, quantum supremacy 1 is unlike most algorithmic tasks because it is defined not in terms of a particular problem to be solved but in terms of what classical computers cannot do. This is like ...