Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
From MaRDI portal
Publication:332332
zbMath1348.11097MaRDI QIDQ332332
Aleksandr Sergeevich Balyuk, Anna Sergeevna Zinchenko
Publication date: 8 November 2016
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: http://isu.ru/journal/downloadArticle?article=_81ead9fa86c04dc7aac69969376f9766&lang=rus
Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99) Polynomials over finite fields (11T06)
Related Items
On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials, Complexity of function systems over a finite field in the class of polarized polynomial forms, Lower bound of the complexity of seven-valued functions in the class of polarized polynomials
Cites Work
- Unnamed Item
- Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
- A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
- Complexity of Boolean functions in the class of polarized polynomial forms
- On complexity of representation of multiple-valued logic functions as polarised polynomials
