A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
From MaRDI portal
Publication:1759162
DOI10.3103/S0278641912030041zbMath1250.94074MaRDI QIDQ1759162
Publication date: 20 November 2012
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials ⋮ 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 ⋮ 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 ⋮ Complexity lower bound for Boolean functions in the class of extended operator forms
Cites Work
This page was built for publication: A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
