Pages that link to "Item:Q5470715"
From MaRDI portal
The following pages link to Lower Bounds for Local Search by Quantum Arguments (Q5470715):
Displayed 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)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- (Q6176155) (← links)