Pages that link to "Item:Q6075757"
From MaRDI portal
The following pages link to On the Complexity of String Matching for Graphs (Q6075757):
Displaying 4 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Chaining of maximal exact matches in graphs (Q6545445) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)
