Tighter Upper Bounds on the Exact Complexity of String Matching (Q4340774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1021214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter Upper Bounds on the Exact Complexity of String Matching |
scientific article; zbMATH DE number 1021214 |
Statements
Tighter Upper Bounds on the Exact Complexity of String Matching (English)
0 references
12 June 1997
0 references
string matching
0 references
exact complexity
0 references
comparisons
0 references
periodicity
0 references
online algorithms
0 references
0.8974717855453491
0 references
0.8903146386146545
0 references
0.8812953233718872
0 references
0.8394467830657959
0 references
