Pages that link to "Item:Q2629755"
From MaRDI portal
The following pages link to Lower bounds of temporal and spatial complexity of the substring search problem (Q2629755):
Displaying 3 items.
- The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823) (← links)
- Complexity of substring search in a set of strings (Q1791617) (← links)
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. (Q5369541) (← links)