Upper Bounds of the Complexity of Functions over Finite Fields in Some Classes of Kroneker Forms
Polynomial representations of Boolean functions have been studied well enough. Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. There are a lot of difficulties in studying of the complexity of these representations. Only...
Main Authors: | A.S. Baliuk, G.V. Yanushkovsky |
---|---|
Format: | Article |
Language: | English |
Published: |
Irkutsk State University
2015-12-01
|
Series: | Известия Иркутского государственного университета: Серия "Математика" |
Subjects: | |
Online Access: | http://isu.ru/journal/downloadArticle?article=_0bad5653ebd94771afe45e100d1b0e0e&lang=rus |
Similar Items
-
Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials
by: A. Baliuk, et al.
Published: (2016-06-01) -
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) -
On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
by: A. Kazimirov, et al.
Published: (2016-09-01) -
The radical factors of f(x)−f(y) over finite fields
by: Javier Gomez-Calderon
Published: (1997-01-01)