Pages that link to "Item:Q2971138"
From MaRDI portal
The following pages link to Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138):
Displaying 3 items.
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138) (← links)
