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

DOI10.3103/S0278641917040069MaRDI QIDQ1703296zbMATH OpenOpenAlexFDO

Authors 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

complexityfunction over a finite fieldfunction systemlower boundpolarized polynomial form (PPF)polynomial form

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds of complexity for polarized polynomials over finite fields
• 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 bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms

Cites work

• 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
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 1077209 (Why is no real title available?)
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• 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
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms

Cited in

(4)

• Lower bounds of complexity for polarized polynomials over finite fields
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• scientific article; zbMATH DE number 1866875 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703296)