On the Exact Complexity of String Matching: Upper Bounds (Q4016906)
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 the Exact Complexity of String Matching: Upper Bounds |
scientific article; zbMATH DE number 89497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Exact Complexity of String Matching: Upper Bounds |
scientific article; zbMATH DE number 89497 |
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
0.914502203464508
0 references
0.8827457427978516
0 references
0.8812953233718872
0 references
0.8810938000679016
0 references
0.8728917837142944
0 references
