Complexity of Boolean functions in the class of polarized polynomial forms
From MaRDI portal
Publication:1918784
DOI10.1007/BF02341875zbMath0863.94034OpenAlexW2089168134MaRDI QIDQ1918784
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
Related Items (18)
The length of a single fault detection test for constant-nonpreserving element insertions ⋮ 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 ⋮ 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 ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials ⋮ On the complexity of representation of k-valued functions by generalised polarised polynomials ⋮ Complexity of function systems over a finite field in the class of polarized polynomial forms ⋮ On length of Boolean functions of a small number of variables in the class of pseudo-polynomials ⋮ 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 bounds of complexity for polarized polynomials over finite fields ⋮ Polynomial expansions of Boolean functions in images of nonhomogeneous operators ⋮ 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: Complexity of Boolean functions in the class of polarized polynomial forms
