On the Exact Complexity of String Matching: Upper Bounds (Q4016906): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:04, 6 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Exact Complexity of String Matching: Upper Bounds |
scientific article |
Statements
On the Exact Complexity of String Matching: Upper Bounds (English)
0 references
16 January 1993
0 references
string searching
0 references
text editing
0 references
worst case behavior
0 references
string matching
0 references