Complexity of Boolean functions in the class of polarized polynomial forms

DOI10.1007/BF02341875MaRDI QIDQ1918784zbMATH OpenOpenAlexFDO

Authors Nikolay A. Peryazev

Publication date 11 June 1997

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/187729

zbMATH Keywords

Boolean functionsclass of polarized polynomial formscomplexityShannon functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Complexity of Boolean functions in the class of canonical polarized polynomials
• Complexity of Boolean functions in a class of canonical polarized polynomials
• scientific article; zbMATH DE number 4002032
• On complexity of a particular Boolean functions class
• On complexity of representation of multiple-valued logic functions as polarised polynomials

Cites work

• Complexity of Boolean functions in the class of canonical polarized polynomials

Cited in

(30)

• 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
• A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
• Lower bound of the complexity of seven-valued functions in the class of polarized polynomials
• On complexity of a particular Boolean functions class
• Lower bounds of complexity for polarized polynomials over finite fields
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
• 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 Boolean functions' representations in classes of extended pair-generated operator forms
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• On the complexity of representation of \(k\)-valued functions by generalised polarised polynomials
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• On some series of bases for the set of Boolean functions
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• scientific article; zbMATH DE number 4137717 (Why is no real title available?)
• scientific article; zbMATH DE number 3922538 (Why is no real title available?)
• scientific article; zbMATH DE number 4002032 (Why is no real title available?)
• 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
• An upper bound for complexity of polynomial normal forms of Boolean functions
• On the mean evaluation of polynomially reducible Boolean functions
• Polynomial expansions of Boolean functions in images of nonhomogeneous operators
• Complexity of Boolean functions in a class of canonical polarized polynomials
• Approximate evaluations of characteristic polynomials of Boolean functions
• The length of a single fault detection test for constant-nonpreserving element insertions
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial

This page was built for publication: Complexity of Boolean functions 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 Q1918784)