Pages that link to "Item:Q2179499"

The following pages link to Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499):

Displaying 11 items.

• Upper bounds on the depth of symmetric Boolean functions (Q264012) (← links)
• Complexity and depth of formulas for symmetric Boolean functions (Q334301) (← links)
• De Bruijn sequences and complexity of symmetric functions (Q662186) (← links)
• Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
• New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
• On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993) (← 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)
• Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
• (Q4242390) (← links)
• Concrete Multiplicative Complexity of Symmetric Functions (Q5756689) (← links)