On the complexity of Boolean functions with small number of ones
From MaRDI portal
Recommendations
- Implementation complexity of Boolean functions with a small number of ones
- Asymptotics for the complexity of Boolean functions with small number of ones
- On the multiplicative complexity of Boolean functions
- On complexity of a particular Boolean functions class
- On the complexity of restrictions of Boolean functions
- On the multiplicative complexity of some Boolean functions
- scientific article; zbMATH DE number 4012495
- Comparative analysis of the complexity of Boolean functions with a small number of zeros
- scientific article; zbMATH DE number 4108153
- On estimates on the complexity of restrictions of Boolean functions
Cited in
(10)- On the complexity of balanced Boolean functions
- Asymptotics for the complexity of Boolean functions with small number of ones
- Implementation complexity of Boolean functions with a small number of ones
- Computing smallest MUSes of quantified Boolean formulas
- Estimation of the number of variables of Boolean functions of moderate weight containing no implicent of smaller length
- scientific article; zbMATH DE number 6679846 (Why is no real title available?)
- A structure theorem for Boolean functions with small total influences
- scientific article; zbMATH DE number 7310075 (Why is no real title available?)
- On a small class of Boolean sums
- On the size of binary decision diagrams representing Boolean functions
This page was built for publication: On the complexity of Boolean functions with small number of ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409861)
