Lower Bounds of Complexity for Polarized Polynomials over Finite Fields

详细

We obtain an efficient lower bound of complexity for n-ary functions over a finite field of arbitrary order in the class of polarized polynomials. The complexity of a function is defined as the minimal possible number of nonzero terms in a polarized polynomial realizing the function.