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 4 items.
- Application of Grover's algorithm to check non-resiliency of a Boolean function (Q276563) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Efficient quantum algorithms to construct arbitrary Dicke states (Q481642) (← links)
- On the limits of gate elimination (Q1635510) (← links)
