The following pages link to (Q3549690):
Displaying 8 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
