Pages that link to "Item:Q1854409"
From MaRDI portal
The following pages link to How hard is computing the edit distance? (Q1854409):
Displayed 5 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- A simple attack on some clock-controlled generators (Q980102) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489) (← links)
- String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)