Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials
The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research. Polynomial representations of Boolean functions have been studied well enough. The exact values of the complexity have bee...
Main Authors: | A. Baliuk, A.S. Zinchenko |
---|---|
Format: | Article |
Language: | English |
Published: |
Irkutsk State University
2016-06-01
|
Series: | Известия Иркутского государственного университета: Серия "Математика" |
Subjects: | |
Online Access: | http://isu.ru/journal/downloadArticle?article=_81ead9fa86c04dc7aac69969376f9766&lang=rus |
Similar Items
-
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
by: A.S. Baliuk, et al.
Published: (2017-12-01) -
On Upper Bound of the Complexity of Quasi Polynomial Representations of Functions over Finite Fields
by: A.S. Baliuk
Published: (2014-12-01) -
Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
by: A.S. Baliuk
Published: (2019-12-01) -
Some inequalities for the polar derivative of some classes of polynomials
by: Nuttapong Arunrat, et al.
Published: (2019-10-01) -
Bound conditions on n- polynomials whose coefficients, roots and critical points are integers
by: Aniruth Phon-On, et al.
Published: (2021-04-01)