Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W32 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585467 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
string matching | |||
| Property / zbMATH Keywords: string matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
analysis of algorithms | |||
| Property / zbMATH Keywords: analysis of algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Revision as of 19:55, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm |
scientific article |
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
