The complexity of the Approximate Multiple Pattern Matching Problem for random strings (Q5874424)
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: The complexity of the Approximate Multiple Pattern Matching Problem for random strings |
scientific article; zbMATH DE number 7651063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the Approximate Multiple Pattern Matching Problem for random strings |
scientific article; zbMATH DE number 7651063 |
Statements
7 February 2023
0 references
subcritical graph class
0 references
block statistic
0 references
number of blocks
0 references
number of edges
0 references
number of spanning trees
0 references
The complexity of the Approximate Multiple Pattern Matching Problem for random strings (English)
0 references
0.9284791
0 references
0.8901121
0 references
0.8840277
0 references
0 references
0.8801455
0 references
0.8794665
0 references
0.87877244
0 references
0 references
0.8762453
0 references
0.8739766
0 references
