Pages that link to "Item:Q5056449"
From MaRDI portal
The following pages link to Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time (Q5056449):
Displaying 5 items.
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Constant-factor approximation of near-linear edit distance in near-linear time (Q5144954) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)