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

zbMath1362.11109MaRDI QIDQ2627175

Alekseĭ Sergeevich Kazimirov, Sergeĭ Yur'evich Reĭmerov

Publication date: 30 May 2017

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_09224a7edc4c4f13b025c52fe3f44424&lang=rus

zbMATH Keywords

complexityfinite fieldpolynomialpolarized polynomial

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Lower bounds of complexity for polarized polynomials over finite fields ⋮ Lower bound of the complexity of seven-valued functions in the class of polarized polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• 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 the complexity of representation of k-valued functions by generalised polarised polynomials

This page was built for publication: On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials