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

SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved to be ...

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