Pages that link to "Item:Q2354498"
From MaRDI portal
The following pages link to On the multiplicative complexity of some Boolean functions (Q2354498):
Displaying 15 items.
- Multiplicative complexity of some Boolean functions (Q314127) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- On the complexity of balanced Boolean functions (Q1606934) (← links)
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- (Q2958409) (← links)
- On the positive and the inversion complexity of Boolean functions (Q3142263) (← links)
- (Q3334980) (← links)
- On the complexity of Boolean functions with small number of ones (Q3409861) (← links)
- (Q3781150) (← links)
- (Q4036699) (← links)
- (Q4259977) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)
- On the mean evaluation of polynomially reducible Boolean functions (Q5936693) (← links)