Lower bounds of complexity for polarized polynomials over finite fields

DOI10.1134/S0037446619010014zbMath1460.94098OpenAlexW2936880849WikidataQ128114776 ScholiaQ128114776MaRDI QIDQ2002473

Anna Sergeevna Zinchenko, Aleksandr Sergeevich Balyuk

Publication date: 12 July 2019

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446619010014

zbMATH Keywords

finite fieldpolarized polynomiallower bound of complexity

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Boolean functions (06E30) Boolean functions (94D10)

Related Items (1)

Complexity lower bound for Boolean functions in the class of extended operator forms

Cites Work

• Unnamed Item
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• A proof of a conjecture by Schweizer on the Drinfeld modular polynomial \(\varPhi _T(X,Y)\)
• Lower bound for the complexity of five-valued 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
• Reed-Muller Like Canonic Forms for Multivalued Functions
• On complexity of representation of multiple-valued logic functions as polarised polynomials
• Minimization of Exclusive or and Logical Equivalence Switching Circuits

This page was built for publication: Lower bounds of complexity for polarized polynomials over finite fields