Lower bounds of temporal and spatial complexity of the substring search problem (Q2629755)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds of temporal and spatial complexity of the substring search problem |
scientific article |
Statements
Lower bounds of temporal and spatial complexity of the substring search problem (English)
0 references
7 July 2016
0 references
substring
0 references
search
0 references
lower bound
0 references
