On the multiplicative complexity of Boolean functions
From MaRDI portal
Recommendations
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Multiplicative complexity of some Boolean functions
- On the multiplicative complexity of some Boolean functions
- The number of Boolean functions with multiplicative complexity 2
- On the multiplicative complexity of quasi-quadratic Boolean functions
Cited in
(39)- Multiplication is the easiest nontrivial arithmetic function
- The multiplicative complexity of quadratic boolean forms
- Complexity of Boolean functions over bases with unbounded fan-in gates
- On the complexity of balanced Boolean functions
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Multiplicative complexity of vector valued Boolean functions
- The multiplicative complexity of 6-variable Boolean functions
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Boolean functions with multiplicative complexity 3 and 4
- Critical properties and complexity measures of read-once Boolean functions
- Implementation complexity of Boolean functions with a small number of ones
- Upper bounds on the multiplicative complexity of symmetric Boolean functions
- On the multiplicative complexity of some Boolean functions
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
- On the complexity of the evaluation of transient extensions of Boolean functions
- scientific article; zbMATH DE number 6679846 (Why is no real title available?)
- Multiplicative complexity of some Boolean functions
- On the positive and the inversion complexity of Boolean functions
- The complexity of the representation of multiple-output Boolean functions
- scientific article; zbMATH DE number 3868606 (Why is no real title available?)
- On the complexity of Boolean functions with small number of ones
- Circuit complexity and multiplicative complexity of Boolean functions
- Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4041981 (Why is no real title available?)
- scientific article; zbMATH DE number 176868 (Why is no real title available?)
- scientific article; zbMATH DE number 176872 (Why is no real title available?)
- The Power of Negative Thinking in Multiplying Boolean Matrices
- scientific article; zbMATH DE number 1332656 (Why is no real title available?)
- Local complexity of Boolean functions
- Boolean complexity classes vs. their arithmetic analogs
- scientific article; zbMATH DE number 7310075 (Why is no real title available?)
- Complexity of Linear Boolean Operators
- On the mean evaluation of polynomially reducible Boolean functions
- Diameter Versus Certificate Complexity of Boolean Functions
- The complexity of Boolean functions in different characteristics
- The number of Boolean functions with multiplicative complexity 2
- On the parity complexity measures of Boolean functions
This page was built for publication: On the multiplicative complexity of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976406)