Pages that link to "Item:Q2701384"
From MaRDI portal
The following pages link to Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384):
Displaying 4 items.
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- Quantum algorithms for learning hidden strings with applications to matroid problems (Q6199225) (← links)
- Quantum path parallelism: a circuit-based approach to text searching (Q6636089) (← links)
