|
This article is cited in 3 scientific papers (total in 3 papers)
Lower bounds of complexity for polarized polynomials over finite fields
A. S. Baliuka, A. S. Zinchenkob a LLC Informatics of Medicine, Irkutsk, Russia
b Irkutsk State University, Irkutsk, Russia
Abstract:
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.
Keywords:
lower bound of complexity, polarized polynomial, finite field.
Received: 19.04.2018 Revised: 19.04.2018 Accepted: 17.08.2018
Citation:
A. S. Baliuk, A. S. Zinchenko, “Lower bounds of complexity for polarized polynomials over finite fields”, Sibirsk. Mat. Zh., 60:1 (2019), 3–13; Siberian Math. J., 60:1 (2019), 1–9
Linking options:
https://www.mathnet.ru/eng/smj3054 https://www.mathnet.ru/eng/smj/v60/i1/p3
|
Statistics & downloads: |
Abstract page: | 393 | Full-text PDF : | 46 | References: | 36 | First page: | 15 |
|