Pages that link to "Item:Q2971138"

The following pages link to Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138):

Displaying 5 items.

• Quantum complexity of the approximation for the classes \({\mathcal B}(W^r_p([0,1]^d))\) and \({\mathcal B}(H^r_p([0,1]^d))\) (Q716524) (← links)
• 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)
• Algorithms and Computation (Q5191645) (← links)