Complexity of substring search in a set of strings (Q1791617)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of substring search in a set of strings |
scientific article; zbMATH DE number 6951202
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of substring search in a set of strings |
scientific article; zbMATH DE number 6951202 |
Statements
Complexity of substring search in a set of strings (English)
0 references
10 October 2018
0 references
0 references
0.8969392
0 references
0 references
0.88552594
0 references
0.88038135
0 references
0.8759124
0 references
0.87588966
0 references
0 references
