Computational bound on complexity of polynomial representations of Boolean functions
From MaRDI portal
Recommendations
- On complexity of a particular Boolean functions class
- An upper bound for complexity of polynomial normal forms of Boolean functions
- Complexity lower bound for Boolean functions in the class of extended operator forms
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
- scientific article; zbMATH DE number 3867065
Cited in
(12)- On complexity of a particular Boolean functions class
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- Complexity lower bound for Boolean functions in the class of extended operator forms
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
- Sign-representation of Boolean functions using a small number of monomials
- scientific article; zbMATH DE number 4047102 (Why is no real title available?)
- scientific article; zbMATH DE number 1775486 (Why is no real title available?)
- scientific article; zbMATH DE number 1421070 (Why is no real title available?)
- An upper bound for complexity of polynomial normal forms of Boolean functions
- On the mean evaluation of polynomially reducible Boolean functions
- Approximate evaluations of characteristic polynomials of Boolean functions
- Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
This page was built for publication: Computational bound on complexity of polynomial representations of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943917)
