Pages that link to "Item:Q314127"
From MaRDI portal
The following pages link to Multiplicative complexity of some Boolean functions (Q314127):
Displaying 13 items.
- The complexity of the representation of multiple-output Boolean functions (Q332335) (← links)
- Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts (Q344027) (← links)
- The number of Boolean functions with multiplicative complexity 2 (Q725955) (← links)
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple (Q1823964) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
- The Multiplicative Complexity of Boolean Functions on Four and Five Variables (Q2946971) (← links)
- (Q3334980) (← links)
- (Q3762226) (← links)
- (Q3781150) (← links)