Pages that link to "Item:Q1871829"
From MaRDI portal
The following pages link to Quantum complexities of ordered searching, sorting, and element distinctness (Q1871829):
Displaying 19 items.
- On the power of Ambainis lower bounds (Q557899) (← links)
- A fast natural algorithm for searching (Q596119) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- A lower bound for quantum search of an ordered list (Q1606939) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Quantum binary search algorithm (Q2323771) (← links)
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem (Q2331339) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Graph entropy and quantum sorting problems (Q3580995) (← links)
- Quantum time-space tradeoffs for sorting (Q3581266) (← links)
- (Q4535800) (← links)
- Quantum Existence Testing and Its Application for Finding Extreme Values in Unsorted Databases (Q4564163) (← links)
- Quantum switching and quantum merge sorting (Q4590479) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- Quantum Algorithms for Element Distinctness (Q5317198) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems (Q6536370) (← links)
