Pages that link to "Item:Q5901075"
From MaRDI portal
The following pages link to Quantum and classical query complexities of local search are polynomially related (Q5901075):
Displaying 9 items.
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← links)
- Combinatorial auctions with endowment effect (Q2100637) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Lower Bounds for Local Search by Quantum Arguments (Q5470715) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)