Pages that link to "Item:Q5055912"
From MaRDI portal
The following pages link to How hard is to compute the edit distance (Q5055912):
Displaying 6 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- The undecidability of the unrestricted modified edit distance (Q1390869) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- On the complexity of some word editing problems (Q3970891) (← links)