The following pages link to (Q5417608):
Displayed 3 items.
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)