An upper bound for complexity of polynomial normal forms of Boolean functions
From MaRDI portal
Publication:5704311
DOI10.1515/156939205774464891zbMath1096.94053OpenAlexW2072118218MaRDI QIDQ5704311
Konstantin Dmitrievich Kirichenko
Publication date: 14 November 2005
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/156939205774464891
Related Items (5)
Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms ⋮ 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 ⋮ On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
Cites Work
This page was built for publication: An upper bound for complexity of polynomial normal forms of Boolean functions
