On the complexity of indeterminate strings matching (Q6851435)
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 8166055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of indeterminate strings matching |
scientific article; zbMATH DE number 8166055 |
Statements
On the complexity of indeterminate strings matching (English)
0 references
27 February 2026
0 references
indeterminate strings
0 references
Cartesian tree matching
0 references
order-preserving matching
0 references
parameterized matching
0 references
0 references
