Pages that link to "Item:Q4146674"

The following pages link to On the combinational complexity of certain symmetric Boolean functions (Q4146674):

Displaying 21 items.

• Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
• A Boolean function requiring 3n network size (Q794625) (← 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)
• Models of lower-bounds proofs (Q1107322) (← links)
• A 3n-lower bound on the network complexity of Boolean functions (Q1142030) (← links)
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
• On the limits of gate elimination (Q1635510) (← links)
• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice (Q1904667) (← links)
• Feebly secure cryptographic primitives (Q1946841) (← links)
• Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
• Timed vacuity (Q2024362) (← links)
• On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
• New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
• Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
• On Negations in Boolean Networks (Q3644711) (← links)
• Spanning-Tree Games. (Q5005136) (← links)
• (Q5136330) (← links)
• Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)