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...

Full description

Bibliographic Details
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