A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials

DOI10.3103/S0278641912030041MaRDI QIDQ1759162zbMATH OpenFDO

Authors N. K. Markelov

Publication date 20 November 2012

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

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

zbMATH Keywords

complexitypolarized polynomialpolynomialShannon functionthree-valued function

Mathematics Subject Classification ID

Many-valued logic (03B50)

Cites work

• Complexity of Boolean functions in the class of polarized polynomial forms
• Graphs of Linear Forms on Modules over Boolean Rings
• On the complexity of polarised polynomials of multi-valued logic functions in one variable

Cited in

(10)

• 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 bound of the complexity of seven-valued functions in the class of polarized polynomials
• Lower bounds of complexity for polarized polynomials over finite fields
• Complexity lower bound for Boolean functions in the class of extended operator forms
• Upper bound for the length of functions over a finite field in the class of pseudopolynomials
• 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

This page was built for publication: A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials

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