On the Exact Complexity of String Matching: Lower Bounds (Q3985805): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:57, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Exact Complexity of String Matching: Lower Bounds |
scientific article |
Statements
On the Exact Complexity of String Matching: Lower Bounds (English)
0 references
27 June 1992
0 references
string matching
0 references
string searching
0 references
text editing
0 references
worst case behaviour
0 references
