Arithmetic circuit complexity investigates the computational resources required to evaluate polynomial functions via networks of arithmetic operations. At its core, this field seeks to classify ...
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, ...
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