Faster algorithms for string matching problems: matching the convolution bound (Q6909506)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8112169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for string matching problems: matching the convolution bound |
scientific article; zbMATH DE number 8112169 |
Statements
Faster algorithms for string matching problems: matching the convolution bound (English)
0 references
29 October 2025
0 references
