Pages that link to "Item:Q991778"
From MaRDI portal
The following pages link to New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778):
Displaying 10 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 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)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- (Q5150372) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
