The following pages link to (Q3002763):
Displaying 17 items.
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- On the power of non-adaptive learning graphs (Q488054) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- All Classical Adversary Methods Are Equivalent for Total Functions (Q5061885) (← links)
- (Q5089146) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- A universal adiabatic quantum query algorithm (Q5278028) (← links)
- Automata, Languages and Programming (Q5716754) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
