The following pages link to (Q3396568):
Displaying 9 items.
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
