Lower Bounds of Complexity for Polarized Polynomials over Finite Fields
- 5 Downloads
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.
Keywordslower bound of complexity polarized polynomial finite field
Unable to display preview. Download preview PDF.
- 1.Gegalkine J. J., “L’arithmétisation de la logique symbolique,” Mat. Sb., vol. 35, No. 3–4, 311–377 (1928).Google Scholar
- 2.Muller D. E., “Application of Boolean algebra to switching circuit design and to error detection,” IRE Trans. Electron. Comput., vol. EC–3, no. 3, 6–12 (1954).Google Scholar
- 7.Baliuk A. S. and Yanushkovsky G. V., “Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms,” IIGU Ser. Matematika, vol. 14, 3–17 (2015).Google Scholar
- 8.Kazimirov A. S. and Reymerov S. Yu., “On upper bounds of the complexity of functions over non–prime finite fields in some classes of polarized polynomials,” IIGU Ser. Matematika, vol. 17, 37–45 (2016).Google Scholar