Pages that link to "Item:Q3068638"
From MaRDI portal
The following pages link to The Computational Hardness of Estimating Edit Distance (Q3068638):
Displaying 6 items.
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
- (Q5002705) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- Adaptive metric dimensionality reduction (Q5964069) (← links)
