Complexity of function systems over a finite field in the class of polarized polynomial forms

DOI10.3103/S0278641917040069zbMath1430.94048OpenAlexW2768522070MaRDI QIDQ1703296

Svetlana N. Selezneva, M. M. Gordeev

Publication date: 2 March 2018

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641917040069

zbMATH Keywords

complexitylower boundpolynomial formfunction systempolarized polynomial form (PPF)function over a finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Measures of information, entropy (94A17) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• 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 complexity of representation of multiple-valued logic functions as polarised polynomials
• On the complexity of polarised polynomials of multi-valued logic functions in one variable

This page was built for publication: Complexity of function systems over a finite field in the class of polarized polynomial forms