Pages that link to "Item:Q465106"

The following pages link to Upper bounds for the formula size of symmetric Boolean functions (Q465106):

Displaying 14 items.

• Upper bounds on the depth of symmetric Boolean functions (Q264012) (← links)
• Complexity and depth of formulas for symmetric Boolean functions (Q334301) (← links)
• Improvements on Khrapchenko's theorem (Q685364) (← links)
• New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
• A note on the formula size of the ``mod k'' functions (Q1264165) (← links)
• \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
• Upper bounds for the size and the depth of formulae for MOD-functions (Q1675519) (← links)
• Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
• Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
• (Q4242390) (← links)
• The effect of random restrictions on formula size (Q4696224) (← links)
• The number of Boolean functions computed by formulas of a given size (Q4705331) (← links)
• Pi-sigma-pi threshold formulas (Q4887487) (← links)
• Computing the maximum using \((\min,+)\) formulas (Q5111291) (← links)