A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539)
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: A d-step approach to the maximum number of distinct squares and runs in strings |
scientific article; zbMATH DE number 6484126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(d\)-step approach to the maximum number of distinct squares and runs in strings |
scientific article; zbMATH DE number 6484126 |
Statements
A \(d\)-step approach to the maximum number of distinct squares and runs in strings (English)
0 references
22 September 2015
0 references
\((d,n)\)-parameterization
0 references
\(d\)-step approach
0 references
0.8912708759307861
0 references
0.8809351325035095
0 references
0.8009358048439026
0 references
0.7991052865982056
0 references
