Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms

DOI10.1515/dma-2016-0009zbMathNoneOpenAlexW2343786357MaRDI QIDQ314185

Svetlana N. Selezneva

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0009

zbMATH Keywords

complexityupper estimateBoolean functionfunction of \(k\)-valued logicfunction of three-valued logiclower estimatepolarized polynomial form (PPF)

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On stationary classes of three-value logic functions
• 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 the complexity of generalized polynomials of \(k\)-valued functions
• 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
• Complexity of Boolean functions in the class of canonical polarized polynomials
• ESTIMATIONS OF UNRELIABILITY OF CIRCUITS IN ROSSER — TURKETT BASIS (IN P3) WITH FAULTS OF TYPE 0 AT THE OUTPUTS OF GATES
• An upper bound for complexity of polynomial normal forms of Boolean functions