Pages that link to "Item:Q924152"
From MaRDI portal
The following pages link to Tight bounds for the multiplicative complexity of symmetric functions (Q924152):
Displaying 7 items.
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes (Q2016430) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
