Pages that link to "Item:Q991778"

The following pages link to New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778):

Displaying 18 items.

• Upper bounds on the depth of symmetric Boolean functions (Q264012) (← links)
• Application of Grover's algorithm to check non-resiliency of a Boolean function (Q276563) (← links)
• Complexity and depth of formulas for symmetric Boolean functions (Q334301) (← links)
• Complexity of computation in finite fields (Q378003) (← links)
• Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
• Efficient quantum algorithms to construct arbitrary Dicke states (Q481642) (← links)
• The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
• Lower bounds to the complexity of symmetric Boolean functions (Q914382) (← links)
• On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
• The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
• On the limits of gate elimination (Q1635510) (← links)
• On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
• Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• (Q3360126) (← links)
• Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
• (Q5150372) (← links)
• CNF encodings of symmetric functions (Q6635697) (← links)