Lower bound of the complexity of seven-valued functions in the class of polarized polynomials

zbMath1451.11134MaRDI QIDQ1789733

Aleksandr Sergeevich Balyuk, Anna Sergeevna Zinchenko

Publication date: 10 October 2018

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

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

zbMATH Keywords

complexityfinite fieldlower boundsKronecker formpolarized polynomial

Mathematics Subject Classification ID

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

Cites Work

• 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 upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
• On complexity of representation of multiple-valued logic functions as polarised polynomials

This page was built for publication: Lower bound of the complexity of seven-valued functions in the class of polarized polynomials