A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771)
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 computational substantiation of the d-step approach to the number of distinct squares problem |
scientific article; zbMATH DE number 6626372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational substantiation of the \(d\)-step approach to the number of distinct squares problem |
scientific article; zbMATH DE number 6626372 |
Statements
A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (English)
0 references
12 September 2016
0 references
string
0 references
square
0 references
primitively rooted square
0 references
maximum number of distinct primitively rooted squares
0 references
parameterized approach
0 references
\((d,n-d)\) table
0 references
0.8993681
0 references
0.86869514
0 references
0.8683909
0 references
0.8614724
0 references
0.85589063
0 references
0.84960186
0 references
0.8446804
0 references
