Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
From MaRDI portal
Publication:344027
Recommendations
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials
- On complexity of a particular Boolean functions class
- Multiplicative complexity of some Boolean functions
Cites work
- An upper bound for complexity of polynomial normal forms of Boolean functions
- Asymmetric binary covering codes.
- Complexity of Boolean functions in the class of canonical polarized polynomials
- Complexity of Boolean functions in the class of polarized polynomial forms
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Cited in
(5)- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
- A conjecture about sums of disjoint products
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials
- scientific article; zbMATH DE number 1740046 (Why is no real title available?)
This page was built for publication: Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344027)
