This is a preview. Log in through your library . Abstract Using Newton-type corrections, a simultaneous improvement of a complete set of approximate factors of arbitrary degree of a polynomial is ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback