The following pages link to (Q4535800):
Displaying 13 items.
- A fast natural algorithm for searching (Q596119) (← links)
- Probabilistic comparing and sorting non-orthogonal quantum states (Q1566212) (← links)
- A lower bound for quantum search of an ordered list (Q1606939) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Quantum complexities of ordered searching, sorting, and element distinctness (Q1871829) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Quantum binary search algorithm (Q2323771) (← links)
- Graph entropy and quantum sorting problems (Q3580995) (← links)
- Quantum time-space tradeoffs for sorting (Q3581266) (← links)
- Quantum switching and quantum merge sorting (Q4590479) (← links)
- Quantum Algorithms for Element Distinctness (Q5317198) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems (Q6536370) (← links)
