Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179)
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: Tight bounds on the complexity of the Apostolico-Giancarlo algorithm |
scientific article; zbMATH DE number 6585467
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm |
scientific article; zbMATH DE number 6585467 |
Statements
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (English)
0 references
26 May 2016
0 references
string matching
0 references
analysis of algorithms
0 references
computational complexity
0 references
