On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials

Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. Complexity of those representations is widely studied. This paper introduces new upper bounds on complexity of discrete functions over particular finite fields in class of...

Full description

Bibliographic Details
Main Authors: A. Kazimirov, S. Reymerov
Format: Article
Language:English
Published: Irkutsk State University 2016-09-01
Series:Известия Иркутского государственного университета: Серия "Математика"
Subjects:
Online Access:http://isu.ru/journal/downloadArticle?article=_09224a7edc4c4f13b025c52fe3f44424&lang=rus