On the lower bound for parallel string matching (Q4332447)
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 978269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the lower bound for parallel string matching |
scientific article; zbMATH DE number 978269 |
Statements
On the lower bound for parallel string matching (English)
0 references
13 February 1997
0 references
analysis of algorithms
0 references
design of algorithms
0 references
parallel algorithms
0 references
parallel string matching
0 references
0.8350553512573242
0 references
0.814781665802002
0 references
0.7596731185913086
0 references
