On the Exact Complexity of String Matching: Lower Bounds (Q3985805): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0220063 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988753117 / rank | |||
Normal rank | |||
Latest revision as of 02:46, 20 March 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
