Pages that link to "Item:Q5896965"
From MaRDI portal
The following pages link to Quantum and classical query complexities of local search are polynomially related (Q5896965):
Displaying 9 items.
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Effective Search Problems (Q4304108) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Lower Bounds for Local Search by Quantum Arguments (Q5470715) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5901075) (← links)