Pages that link to "Item:Q3637111"
From MaRDI portal
The following pages link to Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111):
Displaying 4 items.
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)