Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms

zbMath1397.11161MaRDI QIDQ326257

Aleksandr Sergeevich Balyuk, Grigoriĭ Viktorovich Yanushkovskĭ

Publication date: 12 October 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=_0bad5653ebd94771afe45e100d1b0e0e&lang=rus

zbMATH Keywords

complexityfinite fieldpolynomialKronecker form

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (7)

On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials ⋮ Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials ⋮ Complexity of function systems over a finite field in the class of polarized polynomial forms ⋮ Lower bound for the complexity of five-valued polarized polynomials ⋮ 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
• 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: Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms