On improving the worst case running time of the Boyer-Moore string matching algorithm (Q3048242)
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: On improving the worst case running time of the Boyer-Moore string matching algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On improving the worst case running time of the Boyer-Moore string matching algorithm |
scientific article |
Statements
On improving the worst case running time of the Boyer-Moore string matching algorithm (English)
0 references
1979
0 references
worst case running time
0 references
Boyer-Moore string matching algorithm
0 references
computational complexity
0 references
