Pages that link to "Item:Q1107330"
From MaRDI portal
The following pages link to A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330):
Displaying 6 items.
- Constrained string editing (Q1099954) (← links)
- String editing under a combination of constraints (Q1310955) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- The undecidability of the unrestricted modified edit distance (Q1390869) (← links)
- Lower bounding edit distances between permutations (Q2870513) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) (← links)